On two conjectures about the proper connection number of graphs

DOI10.1016/j.disc.2017.04.022zbMath1365.05157arXiv1602.07163OpenAlexW2963880308WikidataQ122981437 ScholiaQ122981437MaRDI QIDQ2359964

Kenta Ozeki, Fei Huang, Colton Magnant, Zhongmei Qin, Xue Liang Li

Publication date: 23 June 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.07163

zbMATH Keywords

diameterproper-path coloring2-connected graphproper connection number3-edge-connected graph

Mathematics Subject Classification ID

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

Related Items (8)

Degree sums and proper connection number of graphs ⋮ Two sufficient conditions for 2-connected graphs to have proper connection number 2 ⋮ Optimal proper connection of graphs ⋮ Properly colored trails, paths, and bridges ⋮ The optimal proper connection number of a graph with given independence number ⋮ Minimum degree and size conditions for the proper connection number of graphs ⋮ Conflict-free connection number and independence number of a graph ⋮ NOTE ON MINIMUM DEGREE AND PROPER CONNECTION NUMBER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proper connection of graphs
• Proper connection numbers of complementary graphs
• Proper connection number and connected dominating sets
• Proper connection number of random graphs
• Rainbow connections of graphs: a survey
• Minimum degree conditions for the proper connection number of graphs
• Minimum degree condition for proper connection number 2
• Rainbow connection in graphs

This page was built for publication: On two conjectures about the proper connection number of graphs