Disconnected g_c-critical graphs

DOI10.1007/S10878-016-0108-7zbMATH Open1376.05063OpenAlexW2568843991MaRDI QIDQ1680488FDOQ1680488

Authors: 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

Recommendations

• Critical graphs with connected complements
• On connected \((\gamma,k)\)-critical graphs
• Critically indecomposable graphs
• Critically \((k,k)\)-connected graphs
• Critical graphs with respect to total domination and connected domination
• scientific article; zbMATH DE number 867644
• Gallai's conjecture for disconnected graphs
• On critically connected digraphs
• scientific article; zbMATH DE number 1194885
• scientific article; zbMATH DE number 6081

zbMATH Keywords

edge-coloringcritical graphclassification of graphschromatic indexedge-covering

Mathematics Subject Classification ID

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

Cites Work

• The NP-Completeness of Edge-Coloring
• Title not available (Why is that?)
• On \(f\)-edge covered critical graphs
• On \(f\)-edge cover-colouring of simple graphs
• Some class 1 graphs on \(g_c\)-colorings
• On \(f\)-edge cover coloring of regular graphs
• On \(f\)-edge cover coloring of nearly bipartite graphs
• On decompositions of a multi-graph into spanning subgraphs
• Some properties on \(f\)-edge covered critical graphs

Cited In (4)

• Acyclic coloring of graphs with maximum degree 7
• A note on polychromatic colorings of plane graphs
• Polychromatic colorings of hypergraphs with high balance
• Edge-critical \(G,H\) colorings.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680488)