On edge covering colorings of graphs

DOI10.1016/j.ipl.2011.07.014zbMath1260.68308OpenAlexW2049213341MaRDI QIDQ1944187

Xia Zhang, Gui Zhen Liu

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.07.014

zbMATH Keywords

graphedge-coloringcombinatorial problemsedge covering coloringedge covering chromatic index

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Some class 1 graphs on \(g_c\)-colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge covering coloring of nearly bipartite graphs
• Equitable edge-colorings of simple graphs
• The NP-Completeness of Edge-Coloring
• On decompositions of a multi-graph into spanning subgraphs
• Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it

This page was built for publication: On edge covering colorings of graphs