Disconnected g_c-critical graphs

DOI10.1007/S10878-016-0108-7MaRDI QIDQ1680488zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• On \(f\)-edge cover coloring of nearly bipartite graphs
• On \(f\)-edge cover coloring of regular graphs
• On \(f\)-edge cover-colouring of simple graphs
• On \(f\)-edge covered critical graphs
• On decompositions of a multi-graph into spanning subgraphs
• Some class 1 graphs on \(g_c\)-colorings
• Some properties on \(f\)-edge covered critical graphs
• The NP-Completeness of Edge-Coloring

Cited in

(4)

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

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)