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

DOI10.1016/j.amc.2023.127843OpenAlexW4317470173MaRDI QIDQ2698135

Xiaoxue Zhang, Yingbin Ma

Publication date: 21 April 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2023.127843

zbMATH Keywords

edge-coloringPC-coloringPC-numberSPC-coloringSPC-number

Mathematics Subject Classification ID

Graph theory (05Cxx) Extremal combinatorics (05Dxx) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizations of graphs having large proper connection numbers
• Rainbow connections for outerplanar graphs with diameter 2 and 3
• Rainbow connection in 3-connected graphs
• Total rainbow \(k\)-connection in graphs
• Proper connection of graphs
• Properly colored paths and cycles
• Proper connection numbers of complementary graphs
• Rainbow connection number and radius
• Proper connection number and connected dominating sets
• Rainbow vertex connection of digraphs
• Rainbow connections of graphs: a survey
• Minimum degree and size conditions for the proper connection number of graphs
• Total rainbow connection numbers of some special graphs
• Rainbow connection numbers of Cayley graphs
• Rainbow connection and minimum degree
• On the rainbow vertex-connection
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)