Some criteria for a graph to be class 1

DOI10.1016/J.DISC.2011.09.035zbMATH Open1246.05051OpenAlexW1969717359MaRDI QIDQ442377FDOQ442377

Authors: S. Akbari, M. Chavooshi, M. Ghanbari, S. Zare, D. 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

Recommendations

• A sufficient condition for a graph to be class 1
• Publication:4862898
• A sufficient condition for a regular graph to be class 1
• scientific article; zbMATH DE number 1439502
• Some sufficient conditions for 1-planar graphs to be class 1
• scientific article; zbMATH DE number 1159503
• A sufficient condition for a planar graph to be of class 1
• scientific article; zbMATH DE number 1135746
• Class one graphs

zbMATH Keywords

coreedge coloringunicyclicclass 1

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Graph theory
• The NP-Completeness of Edge-Coloring
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On small graphs critical with respect to edge colourings
• Chromatic-index-critical graphs of orders 11 and 12
• Chromatic-index-critical graphs of orders 13 and 14
• The chromatic index of a graph whose core has maximum degree two
• Chromatic index critical graphs of even order with five major vertices
• A sufficient condition for a regular graph to be class 1
• Title not available (Why is that?)
• 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
• An extension of Vizing's adjacency lemma of edge chromatic critical graphs
• Colouring the petals of a graph
• 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
• Title not available (Why is that?)

Cited In (14)

• Graphs of \(f\)-class 1
• Edge-colouring graphs with bounded local degree sums
• The chromatic index of a graph whose core has maximum degree 2
• The chromatic index of a claw-free graph whose core has maximum degree 2
• Title not available (Why is that?)
• Class one graphs
• More on the rainbow disconnection in graphs
• Sufficient conditions for a graph to be edge-colorable with maximum degree colors
• The chromatic index of a graph whose core is a cycle of order at most 13
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• Title not available (Why is that?)
• Bounds for the rainbow disconnection numbers of graphs
• Some results on the \(f\)-chromatic index of graphs whose \(f\)-core has maximum degree 2
• On the chromatic edge stability index of graphs

This page was built for publication: Some criteria for a graph to be class 1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442377)