|
6
|
On small graphs critical with respect to edgecolourings
– L W Beineke, S Fiorini
- 1976
|
|
12
|
Regular graphs of high degree are 1-factorizable
– A. G. Chetwynd, A. J. W. Hilton
- 1985
|
|
109
|
The factorization of linear graphs
– W T Tutte
- 1947
|
|
1
|
Chromatic Index Critical graphs of even order
– S Gr unewald, E Steffen
|
|
18
|
Some unsolved problems in graph theory
– V Vizing
- 1968
|
|
2
|
There are no edge-chromatic 4-critical graphs of order 12
– S A Choudum, K Kayathri
- 1995
|
|
1
|
C.M.: Remarks on the critical graph conjecture
– I Broere, Mynhardt
- 1979
|
|
1
|
Z-X.: Alternative proofs of three theorems of Chetwynd and
– H P Yap, Song
- 2001
|
|
2
|
3- and 4-critical graphs of small even order
– G Brinkmann, E Steffen
- 1997
|
|
6
|
multigraphs with three vertices of maximum degree
– A G Chetwynd, A J W Hilton, Star
- 1986
|
|
2
|
A.J.W.: The chromatic index of graphs with at most four vertices of maximum degree
– A G Chetwynd, Hilton
- 1984
|
|
5
|
Chromatic index critical graphs of odd order with five major vertices
– Z Song
|
|
12
|
Some Topics in Graph Theory
– H P Yap
- 1986
|
|
30
|
Critical graphs with given chromatic class (in Russian). Metody Diskret
– V G Vizing
- 1965
|
|
1
|
Covering cubic graphs with perfect matchings
– D Archdeacon
|
|
1
|
Edge covers of K2n with 2n one–factors. Rendiconti del Seminario Matematico di
– A Bonisoli
|
|
2
|
Chromatic index critical graphs of order 9
– A G Chetwynd, H P Yap
- 1983
|
|
1
|
personal communication
– W D Wallis
|
|
2
|
Overfull sets of one-factors
– W D Wallis
|
