Two conjectures on edge-colouring
From MaRDI portal
Publication:1123197
DOI10.1016/0012-365X(89)90198-2zbMath0677.05025OpenAlexW2120931046WikidataQ123179698 ScholiaQ123179698MaRDI QIDQ1123197
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(89)90198-2
Related Items (12)
How to find overfull subgraphs in graphs with large maximum degree ⋮ Vertex-splitting and chromatic index critical graphs ⋮ On edge-colouring indifference graphs ⋮ Decompositions for the edge colouring of reduced indifference graphs. ⋮ Some criteria for a graph to be class 1 ⋮ The chromatic index of a graph whose core has maximum degree two ⋮ Recent results on the total chromatic number ⋮ The chromatic index of a graph whose core is a cycle of order at most 13 ⋮ On edge-colouring indifference graphs ⋮ Unnamed Item ⋮ Bounds for the rainbow disconnection numbers of graphs ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- The edge-chromatic class of regular graphs of degree 4 and their complements
- Critical star multigraphs
- Recent progress on edge-colouring graphs
- Reverse class critical multigraphs
- 1-factorizing regular graphs of high degree - an improved bound
- Graphs which are vertex-critical with respect to the edge-chromatic number
- The NP-Completeness of Edge-Coloring
- 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: Two conjectures on edge-colouring
