Results 1 
7 of
7
Regular graphs of high degree are 1factorizable
 PROC. LONDON MATH. SOC
, 1985
"... It is a wellknown conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ^ n, then G is the union of edgedisjoint 1factors. It is well known that this conjecture is true for d(G) equal to 2n —1 or 2n — 2. We show here that it is true for d(G) equal to2n — 3, In — 4, or2 ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
It is a wellknown conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ^ n, then G is the union of edgedisjoint 1factors. It is well known that this conjecture is true for d(G) equal to 2n —1 or 2n — 2. We show here that it is true for d(G) equal to2n — 3, In — 4, or2n — 5. We also show that it is true for </(G)>$K(G).
Chromatic Index Critical Graphs of Even Order with Five Major Vertices
"... We prove that there does not exist any chromatic index critical graph of even order with exactly five vertices of maximum degree. This extends an earlier result of Chetwynd and Hilton who proved the same with five replaced by four or three. 1 ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We prove that there does not exist any chromatic index critical graph of even order with exactly five vertices of maximum degree. This extends an earlier result of Chetwynd and Hilton who proved the same with five replaced by four or three. 1
The 1Factorization Problem and some related Conjectures
, 2004
"... E dalla crisalide sbucó una farfalla meravigliosa, tanto che tutti i fiori si aprirono ad essa. Out of the chrysalis there came a beautiful butterfly. It was so beautiful that all the flowers opened up to it. Daniela Rigato (19511996) The Classification Problem is the problem of determining whether ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
E dalla crisalide sbucó una farfalla meravigliosa, tanto che tutti i fiori si aprirono ad essa. Out of the chrysalis there came a beautiful butterfly. It was so beautiful that all the flowers opened up to it. Daniela Rigato (19511996) The Classification Problem is the problem of determining whether or not a given graph is ∆edge colourable, where ∆ is the maximum degree. This problem is known to be NPhard, even when restricted to the class of cubic simple graphs. A theorem of Chetwynd and Hilton states that all regular graphs of order 2n and degree at least ( √ 7−1 2
Excessive Factorizations of Regular Graphs
"... Abstract. An excessive factorization of a graph G is a minimum set F of 1–factors of G whose union is E(G). In this paper we study excessive factorizations of regular graphs. We introduce two graph parameters related to excessive factorizations and show that their computation is NPhard. We pose a n ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. An excessive factorization of a graph G is a minimum set F of 1–factors of G whose union is E(G). In this paper we study excessive factorizations of regular graphs. We introduce two graph parameters related to excessive factorizations and show that their computation is NPhard. We pose a number of questions regarding these parameters. We show that the size of an excessive factorization of a regular graph can exceed the degree of the graph by an arbitrarily large quantity. We conclude with a conjecture on the excessive factorizations of rgraphs.
Chromatic Index Critical Graphs of Orders 11 and 12
, 1997
"... A chromaticindexcritical graph G on n vertices is nontrivial if it has at most \Deltab n 2 c edges. We prove that there is no chromaticindexcritical graph of order 12, and that there are precisely two nontrivial chromatic index critical graphs on 11 vertices. Together with known results thi ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A chromaticindexcritical graph G on n vertices is nontrivial if it has at most \Deltab n 2 c edges. We prove that there is no chromaticindexcritical graph of order 12, and that there are precisely two nontrivial chromatic index critical graphs on 11 vertices. Together with known results this implies that there are precisely three nontrivial chromaticindex critical graphs of order 12. 1 Introduction A famous theorem of Vizing [20] states that the chromatic index Ø 0 (G) of a simple graph G is \Delta(G) or \Delta(G) + 1, where \Delta(G) denotes the maximum vertex degree in G. A graph G is class 1 if Ø 0 (G) = \Delta(G) and it is class 2 otherwise. A class 2 graph G is (chromatic index) critical if Ø 0 (G \Gamma e) ! Ø 0 (G) for each edge e of G. If we want to stress the maximum vertex degree of a critical graph G we say G is \Delta(G)critical. Critical graphs of odd order are easy to construct while not much is known about critical graphs of even order. One reas...