Minimum degree condition for proper connection number 2

DOI10.1016/J.TCS.2016.04.042MaRDI QIDQ2424876zbMATH OpenOpenAlexFDO

Authors F. Huang, Zhongmei Qin, Colton Magnant, Xueliang 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

bridge-block treeminimum degreeproper connection numberproper-path coloring

Mathematics Subject Classification ID

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

Recommendations

• On two conjectures about the proper connection number of graphs
• Degree sum conditions for graphs to have proper connection number 2.
• Two sufficient conditions for 2-connected graphs to have proper connection number 2
• Minimum degree and size conditions for the proper connection number of graphs
• On the minimum degree and the proper connection number of graphs

Cites work

• Graph theory
• On proper-path colorings in graphs
• Panconnected graphs. II
• Proper connection number and connected dominating sets
• Proper connection number of random graphs
• Proper connection numbers of complementary graphs
• Proper connection of graphs
• Rainbow connection in graphs

Cited in

(13)

• Properly colored trails, paths, and bridges
• Graphs with conflict-free connection number two
• Minimum degree and size conditions for the proper connection number of graphs
• Digraphs with proper connection number two
• Hardness results for three kinds of colored connections of graphs
• On two conjectures about the proper connection number of graphs
• Proper connection number of bipartite graphs.
• Degree sum conditions for graphs to have proper connection number 2.
• On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2
• Note on minimum degree and proper connection number
• The fine-grained complexity of approximately counting proper connected colorings (extended abstract)
• List proper connection of 2-edge-connected graphs
• Minimum degree and size conditions for the graphs of proper connection number 2

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

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