Some sufficient conditions for a graph to be of \(C_f\) 1

DOI10.1016/j.aml.2005.03.006zbMath1079.05034OpenAlexW2025144831MaRDI QIDQ812743

Xia Zhang, Gui Zhen Liu

Publication date: 24 January 2006

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

Full work available at URL: https://doi.org/10.1016/j.aml.2005.03.006

zbMATH Keywords

edge coloringclassification of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Unnamed Item ⋮ A note on M2-edge colorings of graphs ⋮ The method of coloring in graphs and its application ⋮ 随机图的$f$-染色的分类 II ⋮ \(\mathrm{M}_2\)-edge colorings of cacti and graph joins ⋮ On \(f\)-colorings of nearly bipartite graphs ⋮ \(f\)-class two graphs whose \(f\)-cores have maximum degree two ⋮ The classification of \(f\)-coloring of graphs with large maximum degree ⋮ \(f\)-colorings of some graphs of \(f\)-class 1 ⋮ Some graphs of class 1 for \(f\)-colorings ⋮ Graphs of \(f\)-class 1 ⋮ On the fractionalf-chromatic index of a graph

Cites Work

• A sufficient condition for equitable edge-colourings of simple graphs
• A generalization of edge-coloring in graphs
• On the f-coloring of multigraphs
• The NP-Completeness of Edge-Coloring
• Edge-Coloring Problems for Graphs.
• Unnamed Item
• Unnamed Item

This page was built for publication: Some sufficient conditions for a graph to be of \(C_f\) 1