Disconnected \(g_c\)-critical graphs

DOI10.1007/s10878-016-0108-7zbMath1376.05063OpenAlexW2568843991MaRDI QIDQ1680488

Xia Zhang

Publication date: 16 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0108-7

zbMATH Keywords

edge-coloringchromatic indexcritical graphclassification of graphsedge-covering

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 (3)

Polychromatic colorings of hypergraphs with high balance ⋮ Acyclic coloring of graphs with maximum degree 7 ⋮ A note on polychromatic colorings of plane graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some class 1 graphs on \(g_c\)-colorings
• On \(f\)-edge cover coloring of nearly bipartite graphs
• On \(f\)-edge cover-colouring of simple graphs
• Some properties on \(f\)-edge covered critical graphs
• The NP-Completeness of Edge-Coloring
• On decompositions of a multi-graph into spanning subgraphs

This page was built for publication: Disconnected \(g_c\)-critical graphs