Abstract
Every critical graph is connected on proper edge-colorings of simple graphs. In contrast, there not only exist connected critical graphs but exist disconnected critical graphs on \(g_c\)-colorings of simple graphs. In this article, disconnected \(g_c\)-critical graphs are studied firstly and their structure characteristics are depicted.
Similar content being viewed by others
References
Gupta RP (1974) On decompositions of a multigraph into spanning subgraphs. Bull Am Math Soc 80:500–502
Holyer I (1981) The \(NP\)-completeness of edge colorings. SIAM J Comput 10(4):718–720
Li J, Liu G (2011a) On \(f\)-edge cover coloring of nearly bipartite graphs. Bull Malays Math Sci Soc (2) 34(2):247–253
Li J, Liu G (2011b) On \(f\)-edge cover-coloring of regular graphs. Util Math 84:65–73
Li J, Liu G (2012) On \(f\)-edge covered critical graphs. J Comb Math Comb Comput 83:3–11
Ma H, Zhang X (2016) Some class 1 graphs on gc-colorings. Acta Math Sin Engl Ser 32(10):1237–1245
Song H, Liu G (2005) On \(f\)-edge cover-coloring of simple graphs. Acta Math Sci 25B(1):145–151
Vizing VG (1964) On an estimate of the chromatic class of a \(p\)-graph. Diskret Anal 3:25–30 (Russian)
Vizing VG (1965) Critical graphs with a given chromatic class. Diskret Anal 5:9–17 (Russian)
Wang J, Hou J, Liu G (2007a) Some properties on \(f\)-edge covered critical graphs. J Appl Math Comput 24(1–2):357–366
Wang J, Zhang S, Hou J (2007b) On \(f\)-edge cover-coloring of simple graphs. In: 7th international conference on computational science (ICCS 2007), Beijing, China, 27–30 May, Part III, LNCS 4489, pp 448–452
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the Shandong Provincial Natural Science Foundation, China (Grant No. ZR2014JL001), the Shandong Province Higher Educational Science and Technology Program (Grant No. J13LI04) and the Excellent Young Scholars Research Fund of Shandong Normal University of China.
Rights and permissions
About this article
Cite this article
Zhang, X. Disconnected \(g_c\)-critical graphs. J Comb Optim 34, 771–780 (2017). https://doi.org/10.1007/s10878-016-0108-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-016-0108-7