\(f\)-class two graphs whose \(f\)-cores have maximum degree two

DOI10.1007/s10114-014-3145-0zbMath1288.05106OpenAlexW2068661660MaRDI QIDQ2452406

Xia Zhang, Jian-Sheng Cai, Gui Ying Yan

Publication date: 3 June 2014

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-014-3145-0

zbMATH Keywords

simple graph\(f\)-chromatic index\(f\)-coloring\(f\)-class 2

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Unnamed Item ⋮ On \(f\)-colorings of nearly bipartite graphs ⋮ The classification of \(f\)-coloring of graphs with large maximum degree ⋮ Graphs of \(f\)-class 1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Color degree and heterochromatic cycles in edge-colored graphs
• Rainbow matchings in properly edge colored graphs
• Some sufficient conditions for a graph to be of \(C_f\) 1
• \(f\)-colorings of some graphs of \(f\)-class 1
• Heterochromatic matchings in edge-colored graphs
• Color degree and alternating cycles in edge-colored graphs
• \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
• Some graphs of class 1 for \(f\)-colorings
• The classification of complete graphs \(K_n\) on \(f\)-coloring
• Equitable edge-colorings of simple graphs
• A generalization of edge-coloring in graphs
• The NP-Completeness of Edge-Coloring
• Some results about f‐critical graphs

This page was built for publication: \(f\)-class two graphs whose \(f\)-cores have maximum degree two