Graphs with (strong) proper connection numbers m−3 and m−4

Yingbin Ma and Xiaoxue Zhang

Applied Mathematics and Computation, 2023, vol. 445, issue C

Abstract: In 2016, Lumduanhom et al. determined all graphs of size m with PC-number or SPC-number m−1, m−2, m−3. But we find that the graphs with SPC-number m−3 are not completely characterized. In this article, we characterize all graphs with SPC-number m−3. Moreover, we present all graphs satisfying PC-number or SPC-number m−4.

Keywords: PC-number; SPC-number; Edge-coloring; Pc-coloring; Spc-coloring (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323000127
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:445:y:2023:i:c:s0096300323000127

DOI: 10.1016/j.amc.2023.127843

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().