Disconnected $$g_c$$ g c -critical graphs

Xia Zhang ()
Additional contact information
Xia Zhang: Shandong Normal University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 3, No 9, 780 pages

Abstract: 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$$ g c -colorings of simple graphs. In this article, disconnected $$g_c$$ g c -critical graphs are studied firstly and their structure characteristics are depicted.

Keywords: Edge-coloring; Edge-covering; Chromatic index; Critical graph; Classification of graphs; 05C15 (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0108-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:3:d:10.1007_s10878-016-0108-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0108-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().