Minimum degree condition for proper connection number 2

DOI10.1016/j.tcs.2016.04.042zbMath1428.05109OpenAlexW2414388691MaRDI QIDQ2424876

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

Publication date: 25 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.042

zbMATH Keywords

minimum degreeproper-path coloringproper connection numberbridge-block tree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (5)

On two conjectures about the proper connection number of graphs ⋮ Hardness results for three kinds of colored connections of graphs ⋮ Properly colored trails, paths, and bridges ⋮ Graphs with conflict-free connection number two ⋮ Digraphs with proper connection number two

Cites Work

• 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
• Panconnected graphs. II
• Rainbow connections of graphs: a survey
• Rainbow connection in graphs

This page was built for publication: Minimum degree condition for proper connection number 2