On Graphs with Proper Connection Number 2

DOI10.20429/TAG.2021.080202MaRDI QIDQ3380403zbMATH OpenOpenAlexFDO

Authors Glenn G. Chappell, Chris Hartman, J. R. Faudree, Leah Wrenn Berman, John Gimbel, Gordon Williams

Publication date 28 September 2021

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2021.080202

zbMATH Keywords

edge-colored graphproper connection numberflexible connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• Proper connection number 2, connectivity, and forbidden subgraphs
• On the minimum degree and the proper connection number of graphs
• Minimum degree conditions for the proper connection number of graphs
• Proper connection with many colors
• Two sufficient conditions for 2-connected graphs to have proper connection number 2
• Proper connection of graphs
• Proper connection and size of graphs
• Sharp Nordhaus-Gaddum-type lower bounds for proper connection numbers of graphs
• Proper‐walk connection number of graphs
• Proper connection number of bipartite graphs.

Cited in

(10)

• On ‐connected graphs
• Two sufficient conditions for 2-connected graphs to have proper connection number 2
• On perfectly two-edge connected graphs
• Note on the vertex 2–connectivity of a graph
• Proper connection number of bipartite graphs.
• Strongly proper connected coloring of graphs
• On the (di)graphs with (directed) proper connection number two
• List proper connection of 2-edge-connected graphs
• Chromatic-connection in graphs
• Proper connection number 2, connectivity, and forbidden subgraphs

This page was built for publication: On Graphs with Proper Connection Number 2

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