Graphs of \(f\)-class 1

DOI10.1016/j.dam.2017.01.010zbMath1396.05043OpenAlexW2586049506MaRDI QIDQ1786886

Xia Zhang, Jian-Feng Hou, Gui Ying Yan, Gui Zhen Liu

Publication date: 25 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.01.010

zbMATH Keywords

edge-coloring\(f\)-chromatic index\(f\)-coloring\(f\)-class 1classification of graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On \(f\)-colorings of nearly bipartite graphs

Cites Work

• Some criteria for a graph to be class 1
• Some sufficient conditions for a graph to be of \(C_f\) 1
• \(f\)-colorings of some graphs of \(f\)-class 1
• Class one graphs
• \(f\)-class two graphs whose \(f\)-cores have maximum degree two
• Some graphs of class 1 for \(f\)-colorings
• The classification of complete graphs \(K_n\) on \(f\)-coloring
• A generalization of edge-coloring in graphs
• Improved bounds for the chromatic index of graphs and multigraphs
• Some results about f‐critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs of \(f\)-class 1