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

DOI10.1017/S0305004100067244MaRDI QIDQ3767367zbMATH OpenFDO

Authors A. J. W. Hilton, P. D. jun. Johnson

Publication date 1987

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

Full work available at URL https://doi.org/10.1017/S0305004100067244

zbMATH Keywords

multigraphsedge-chromatic number

Mathematics Subject Classification ID

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

Recommendations

• Graphs which are vertex‐critical with respect to the edge‐chromatic class
• A note on vertex-criticality with respect to edge-coloring
• Critical star multigraphs
• A note concerning the chromatic index of multigraphs
• Edge covered critical multigraphs

Cites work

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

Cited in

(15)

• A note on vertex-criticality with respect to edge-coloring
• On the chromatic index of join graphs and triangle-free graphs with large maximum degree
• Critical star multigraphs
• Recent progress on edge-colouring graphs
• Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs
• Characterizing and edge-colouring split-indifference graphs
• Edge-colouring graphs with bounded local degree sums
• Edge coloring regular graphs of high degree
• The overfull conjecture on split-comparability and split-interval graphs
• Two conjectures on edge-colouring
• scientific article; zbMATH DE number 7511519 (Why is no real title available?)
• A theorem in edge colouring
• Graphs which are vertex‐critical with respect to the edge‐chromatic class
• Edge‐chromatic critical graphs and the existence of 1‐factors
• Edge-colouring of join graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767367)