메뉴 건너뛰기




Volumn 30, Issue 1, 1999, Pages 27-36

Chromatic-index-critical graphs of even order

Author keywords

1 factors; Chromatic index critical graphs; Critical graph conjecture; Edge colorings

Indexed keywords


EID: 0039626505     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199901)30:1<27::AID-JGT4>3.0.CO;2-Z     Document Type: Article
Times cited : (18)

References (11)
  • 1
    • 0040797690 scopus 로고
    • On the edge chromatic number of a graph
    • L. W. Beineke, R. J. Wilson, On the edge chromatic number of a graph, Discrete Math 5 (1973), 15-20.
    • (1973) Discrete Math , vol.5 , pp. 15-20
    • Beineke, L.W.1    Wilson, R.J.2
  • 3
    • 84986516431 scopus 로고
    • The rise and fall of the critical graph conjecture
    • A. G. Chetwynd, R. J. Wilson, The rise and fall of the critical graph conjecture, J Graph Theory 7 (1983), 153-157.
    • (1983) J Graph Theory , vol.7 , pp. 153-157
    • Chetwynd, A.G.1    Wilson, R.J.2
  • 4
    • 0039611795 scopus 로고
    • Chromatic index critical graphs of order 9
    • A. G. Chetwynd, H. P. Yap, Chromatic index critical graphs of order 9, Discrete Math 47 (1983), 23-33.
    • (1983) Discrete Math , vol.47 , pp. 23-33
    • Chetwynd, A.G.1    Yap, H.P.2
  • 5
    • 84987584190 scopus 로고
    • Edge-chromatic critical graphs and the existence of 1-factors
    • S. A. Choudum, Edge-chromatic critical graphs and the existence of 1-factors, J Graph Theory 17 (1993), 23-29.
    • (1993) J Graph Theory , vol.17 , pp. 23-29
    • Choudum, S.A.1
  • 6
    • 0002013279 scopus 로고
    • Edge-colourings of graphs
    • L. W. Beineke, R. J. Wilson (Editors), Academic, London
    • S. Fiorini, R. J. Wilson, Edge-colourings of graphs, in Selected topics in graph theory, L. W. Beineke, R. J. Wilson (Editors), Academic, London, 1978, pp. 103-126.
    • (1978) Selected Topics in Graph Theory , pp. 103-126
    • Fiorini, S.1    Wilson, R.J.2
  • 7
    • 0010961270 scopus 로고
    • Construction of class 2 graphs with maximum vertex degree 3
    • M. K. Goldberg, Construction of class 2 graphs with maximum vertex degree 3, J Combin Theory Ser B 31 (1981), 282-291.
    • (1981) J Combin Theory Ser B , vol.31 , pp. 282-291
    • Goldberg, M.K.1
  • 8
    • 0000292573 scopus 로고
    • On critical graphs with chromatic index 4
    • I. T. Jakobsen, On critical graphs with chromatic index 4, Discrete Math 9 (1974), 265-276.
    • (1974) Discrete Math , vol.9 , pp. 265-276
    • Jakobsen, I.T.1
  • 9
    • 0008973237 scopus 로고
    • Regular n-valent n-connected non-hamiltonian non-n-edge-colorable graphs
    • G. H. J. Meredith, Regular n-valent n-connected non-hamiltonian non-n-edge-colorable graphs, J Combin Theory Ser B 14 (1973), 55-60.
    • (1973) J Combin Theory Ser B , vol.14 , pp. 55-60
    • Meredith, G.H.J.1
  • 10
    • 0002935868 scopus 로고
    • On an estimate of the chromatic class of a p-graph
    • V. G. Vizing On an estimate of the chromatic class of a p-graph, Diskret Analiz 3 (1964), 25-30.
    • (1964) Diskret Analiz , vol.3 , pp. 25-30
    • Vizing, V.G.1
  • 11
    • 0007325733 scopus 로고
    • Some topics in graph theory
    • University Press, Cambridge, England
    • H. P. Yap, Some topics in graph theory, London Math. Soc. LNS 108, University Press, Cambridge, England 1986.
    • (1986) London Math. Soc. LNS , vol.108
    • Yap, H.P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.