The chromatic index of a claw-free graph whose core has maximum degree 2
From MaRDI portal
(Redirected from Publication:2354597)
Recommendations
Cites work
- 1-factorizing regular graphs of high degree - an improved bound
- A \(\Delta\)-subgraph condition for a graph to be class 1
- A Sufficient Condition for a Graph to be the Core of a Class 2 Graph
- A sufficient condition for a regular graph to be class 1
- Chromatic index critical graphs of even order with five major vertices
- Colouring the petals of a graph
- Cores of class II graphs
- Graphs with 1-Factors
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 927053 (Why is no real title available?)
- scientific article; zbMATH DE number 3428958 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- Some criteria for a graph to be class 1
- The chromatic index of a graph whose core has maximum degree 2
- The chromatic index of a graph whose core has maximum degree two
- The NP-Completeness of Edge-Coloring
- Two conjectures on edge-colouring
Cited in
(8)- Graph edge coloring: a survey
- Overfullness of critical class 2 graphs with a small core degree
- The chromatic index of a graph whose core has maximum degree 2
- The Hilton-Zhao conjecture is true for graphs with maximum degree 4
- On color frames of claws in graphs
- The core conjecture of Hilton and Zhao
- On the chromatic index of complementary prisms
- On the (1, 2⁵)-packing edge-colorings of claw-free subcubic graphs
This page was built for publication: The chromatic index of a claw-free graph whose core has maximum degree 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2354597)