The chromatic index of a graph whose core is a cycle of order at most 13
From MaRDI portal
Publication:742593
DOI10.1007/S00373-013-1317-9zbMath1298.05098OpenAlexW2052512409MaRDI QIDQ742593
Mohammad Javad Nikmehr, Saieed Akbari, Maryam Ghanbari
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1317-9
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The chromatic index of a graph whose core has maximum degree 2
- Some criteria for a graph to be class 1
- New results on chromatic index critical graphs
- A \(\Delta\)-subgraph condition for a graph to be class 1
- 1-factorizing regular graphs of high degree - an improved bound
- Two conjectures on edge-colouring
- The chromatic index of a graph whose core has maximum degree two
- Colouring the petals of a graph
- Chromatic index critical graphs of even order with five major vertices
- The NP-Completeness of Edge-Coloring
- A sufficient condition for a regular graph to be class 1
- A Sufficient Condition for a Graph to be the Core of a Class 2 Graph
- Cores of class II graphs
This page was built for publication: The chromatic index of a graph whose core is a cycle of order at most 13
