Edge covering coloring of nearly bipartite graphs

DOI10.1007/BF02896491zbMath1114.05042OpenAlexW1964919978MaRDI QIDQ854458

Xia Zhang, Ji Hui Wang, Gui Zhen Liu

Publication date: 4 December 2006

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

Full work available at URL: https://doi.org/10.1007/bf02896491

zbMATH Keywords

edge covering chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On $g_c$-colorings of nearly bipartite graphs ⋮ On edge covering colorings of graphs ⋮ Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph ⋮ Fractional \(f\)-edge cover chromatic index of graphs

Cites Work

• Unnamed Item
• A sufficient condition for equitable edge-colourings of simple graphs
• Chromatic sums of nonseparable simple maps on the plane.
• Chromatic sums of singular maps on some surfaces.
• 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: Edge covering coloring of nearly bipartite graphs