Some criteria for a graph to be class 1
From MaRDI portal
Publication:442377
DOI10.1016/j.disc.2011.09.035zbMath1246.05051MaRDI QIDQ442377
Saieed Akbari, Maryam Ghanbari, Sanaz Zare, M. Chavooshi, David Cariolaro
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.035
Related Items
Unnamed Item, On the chromatic edge stability index of graphs, The chromatic index of a graph whose core is a cycle of order at most 13, Graphs of \(f\)-class 1, Bounds for the rainbow disconnection numbers of graphs, More on the rainbow disconnection in graphs, Edge-colouring graphs with bounded local degree sums, The chromatic index of a claw-free graph whose core has maximum degree 2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On small graphs critical with respect to edge colourings
- Chromatic-index-critical graphs of orders 11 and 12
- An extension of Vizing's adjacency lemma of edge chromatic critical graphs
- Colouring the petals of a graph
- Chromatic index critical graphs of even order with five major vertices
- Chromatic-index-critical graphs of orders 13 and 14
- The NP-Completeness of Edge-Coloring
- A sufficient condition for a regular graph to be class 1
- Cycles through vertices of large maximum degree
- A Sufficient Condition for a Graph to be the Core of a Class 2 Graph
- Cores of class II graphs