Recent progress on edge-colouring graphs
From MaRDI portal
Publication:1090683
DOI10.1016/0012-365X(87)90200-7zbMath0622.05021OpenAlexW1999245126MaRDI QIDQ1090683
Publication date: 1987
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(87)90200-7
Related Items (6)
The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) ⋮ Vertex-splitting and chromatic index critical graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Two conjectures on edge-colouring ⋮ The chromatic index of a graph whose core has maximum degree two ⋮ Recent results on the total chromatic number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
- The chromatic index of graphs with large maximum degree
- A \(\Delta\)-subgraph condition for a graph to be class 1
- Critical star multigraphs
- Counterexamples to two conjectures of Hilton
- A generalization of Plantholt's theorem
- Graphs which are vertex-critical with respect to the edge-chromatic number
- Regular Graphs of High Degree are 1-Factorizable
- The chromatic index of graphs of even order with many edges
- Graphs which are vertex‐critical with respect to the edge‐chromatic class
This page was built for publication: Recent progress on edge-colouring graphs