Skip to main content
SpringerLink
Log in

Disconnected \(g_c\)-critical graphs

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

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

    Article  MATH  Google Scholar 

  • Holyer I (1981) The \(NP\)-completeness of edge colorings. SIAM J Comput 10(4):718–720

    Article  MathSciNet  MATH  Google Scholar 

  • Li J, Liu G (2011a) On \(f\)-edge cover coloring of nearly bipartite graphs. Bull Malays Math Sci Soc (2) 34(2):247–253

    MathSciNet  MATH  Google Scholar 

  • Li J, Liu G (2011b) On \(f\)-edge cover-coloring of regular graphs. Util Math 84:65–73

    MathSciNet  MATH  Google Scholar 

  • Li J, Liu G (2012) On \(f\)-edge covered critical graphs. J Comb Math Comb Comput 83:3–11

    MathSciNet  MATH  Google Scholar 

  • Ma H, Zhang X (2016) Some class 1 graphs on gc-colorings. Acta Math Sin Engl Ser 32(10):1237–1245

    Article  MathSciNet  MATH  Google Scholar 

  • Song H, Liu G (2005) On \(f\)-edge cover-coloring of simple graphs. Acta Math Sci 25B(1):145–151

    MATH  Google Scholar 

  • Vizing VG (1964) On an estimate of the chromatic class of a \(p\)-graph. Diskret Anal 3:25–30 (Russian)

    MathSciNet  Google Scholar 

  • Vizing VG (1965) Critical graphs with a given chromatic class. Diskret Anal 5:9–17 (Russian)

    MathSciNet  Google Scholar 

  • Wang J, Hou J, Liu G (2007a) Some properties on \(f\)-edge covered critical graphs. J Appl Math Comput 24(1–2):357–366

    Article  MathSciNet  MATH  Google Scholar 

  • 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

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Shandong Normal University, Jinan, 250014, Shandong, People’s Republic of China

    Xia Zhang

Authors
  1. Xia Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xia Zhang.

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

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-016-0108-7

Keywords

Mathematics Subject Classification

Search

Navigation