Premium
Chromatic‐index‐critical graphs of even order
Author(s) -
Grünewald Stefan,
Steffen Eckhard
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199901)30:1<27::aid-jgt4>3.0.co;2-z
Subject(s) - mathematics , critical graph , combinatorics , counterexample , edge coloring , graph , discrete mathematics , chromatic scale , friendship graph , degree (music) , windmill graph , line graph , graph power , physics , acoustics
A k ‐critical (multi‐) graph G has maximum degree k , chromatic index χ′( G ) = k + 1, and χ′( G − e ) < k + 1 for each edge e of G . For each k ≥ 3, we construct k ‐critical (multi‐) graphs with certain properties to obtain counterexamples to some well‐known conjectures. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 27–36, 1999