The classification of \(f\)-coloring of graphs with large maximum degree

DOI10.1016/j.amc.2017.05.059zbMath1426.05037OpenAlexW2622482471MaRDI QIDQ1740035

Xia Zhang, Jian-Sheng Cai, Gui Ying Yan

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.05.059

zbMATH Keywords

edge coloringcoloringlocal lemma\(f\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

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

Cites Work

• Unnamed Item
• Some sufficient conditions for a graph to be of \(C_f\) 1
• \(f\)-class two graphs whose \(f\)-cores have maximum degree two
• The classification of complete graphs \(K_n\) on \(f\)-coloring
• The f-Chromatic Index of a Graph Whose f-Core Has Maximum Degree 2
• A generalization of edge-coloring in graphs
• The NP-Completeness of Edge-Coloring
• Some results about f‐critical graphs
• Graph colouring and the probabilistic method

This page was built for publication: The classification of \(f\)-coloring of graphs with large maximum degree