Graphs which are vertex-critical with respect to the edge-chromatic number
From MaRDI portal
Publication:3767367
DOI10.1017/S0305004100067244zbMATH Open0631.05024MaRDI QIDQ3767367FDOQ3767367
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)
Recommendations
Cites Work
- The chromatic index of graphs with a spanning star
- Chromatic index critical graphs of order 9
- Regular Graphs of High Degree are 1-Factorizable
- Some remarks on the chromatic index of a graph
- Critical star multigraphs
- The chromatic index of graphs of even order with many edges
- On the critical graph conjecture
- The chromatic index of graphs with large maximum degree
- Counterexamples to two conjectures of Hilton
- Definitions of criticality with respect to edge-coloring
Cited In (14)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs
- Critical star multigraphs
- Recent progress on edge-colouring 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
- Title not available (Why is that?)
- 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)
