On $g_c$-colorings of nearly bipartite graphs

DOI10.21136/CMJ.2018.0477-16zbMath1499.05246OpenAlexW2790190308MaRDI QIDQ4568228

Xia Zhang, Yu-Zhuo Zhang

Publication date: 15 June 2018

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/cmj.2018.0477-16

zbMATH Keywords

edge coloring\(g_c\)-coloringnearly bipartite graphedge covering coloringedge cover decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Polychromatic colorings of hypergraphs with high balance ⋮ A note on polychromatic colorings of plane graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(f\)-edge cover coloring of nearly bipartite graphs
• Edge covering coloring of nearly bipartite graphs
• On \(f\)-edge cover-colouring of simple graphs
• The NP-Completeness of Edge-Coloring
• On decompositions of a multi-graph into spanning subgraphs
• SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS

This page was built for publication: On $g_c$-colorings of nearly bipartite graphs