Graphs which are vertex-critical with respect to the edge-chromatic number

DOI10.1017/S0305004100067244zbMath0631.05024MaRDI QIDQ3767367

Anthony J. W. Hilton, Peter D. jun. Johnson

Publication date: 1987

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

multigraphsedge-chromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Edge-colouring of join graphs ⋮ Recent progress on edge-colouring graphs ⋮ Edge coloring regular graphs of high degree ⋮ Two conjectures on edge-colouring ⋮ Characterizing and edge-colouring split-indifference graphs ⋮ Edge-colouring graphs with bounded local degree sums ⋮ The overfull conjecture on split-comparability and split-interval graphs ⋮ Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs ⋮ On the chromatic index of join graphs and triangle-free graphs with large maximum degree ⋮ Graphs which are vertex‐critical with respect to the edge‐chromatic class

Cites Work

• The chromatic index of graphs with large maximum degree
• Chromatic index critical graphs of order 9
• Critical star multigraphs
• Some remarks on the chromatic index of a graph
• Counterexamples to two conjectures of Hilton
• On the critical graph conjecture
• The chromatic index of graphs with a spanning star
• Definitions of criticality with respect to edge-coloring
• Regular Graphs of High Degree are 1-Factorizable
• The chromatic index of graphs of even order with many edges

This page was built for publication: Graphs which are vertex-critical with respect to the edge-chromatic number