On the proper connection of graphs

DOI10.3934/DCDSS.2026133MaRDI QIDQ7357099zbMATH OpenFDO

Authors Xiaoxue Zhang, Yingbin Ma

Publication date 25 September 2026

Published in Discrete and Continuous Dynamical Systems. Series S (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/DCDSS.2026133

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• Characterizations of graphs having large proper connection numbers
• Graph theory
• Graphs with (strong) proper connection numbers m - 3 and m - 4
• Minimum degree conditions for the proper connection number of graphs
• Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
• On proper-path colorings in graphs
• Proper connection and size of graphs
• Proper connection number and connected dominating sets
• Proper connection numbers of complementary graphs
• Proper connection of graphs
• Proper connection with many colors
• Properly colored paths and cycles
• Rainbow connection in 3-connected graphs
• Rainbow connection in graphs
• Rainbow connection number and graph operations
• Rainbow connections for outerplanar graphs with diameter 2 and 3
• Rainbow connections of graphs
• Rainbow connections of graphs: a survey
• Upper bounds of proper connection number of graphs

This page was built for publication: On the proper connection of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7357099)