Two sufficient conditions for 2-connected graphs to have proper connection number 2

DOI10.1007/s40840-019-00868-9zbMath1441.05075OpenAlexW2992957516WikidataQ126621290 ScholiaQ126621290MaRDI QIDQ2186294

Jinjiang Yuan, Fei Huang, Shan-Shan Guo

Publication date: 9 June 2020

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-019-00868-9

zbMATH Keywords

edge-coloring2-connected graphproper connection numberproper path

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Proper connection of graphs
• Proper connection number and connected dominating sets
• Proper connection number of random graphs
• Maintaining bridge-connected and biconnected components on-line
• Hamiltonian circuits determining the order of chromosomes
• Rainbow connections of graphs: a survey
• On strong proper connection number of cubic graphs
• On two conjectures about the proper connection number of graphs
• Minimum degree conditions for the proper connection number of graphs
• Upper bounds of proper connection number of graphs
• Rainbow connection in graphs
• Properly Colored Connectivity of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two sufficient conditions for 2-connected graphs to have proper connection number 2