A \(\Delta\)-subgraph condition for a graph to be class 1
From MaRDI portal
Publication:1087551
DOI10.1016/0095-8956(89)90005-1zbMath0611.05025OpenAlexW1991846615WikidataQ59233653 ScholiaQ59233653MaRDI QIDQ1087551
Amanda G. Chetwynd, Anthony J. W. Hilton
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90005-1
Related Items (7)
Recent progress on edge-colouring graphs ⋮ The chromatic index of graphs of high maximum degree ⋮ 1-factorizing regular graphs of high degree - an improved bound ⋮ Two conjectures on edge-colouring ⋮ Some criteria for a graph to be class 1 ⋮ The chromatic index of a graph whose core is a cycle of order at most 13 ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2
Cites Work
- 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
- Regular Graphs of High Degree are 1-Factorizable
- The chromatic index of graphs of even order with many edges
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A \(\Delta\)-subgraph condition for a graph to be class 1
