Upper bounds of proper connection number of graphs

DOI10.1007/s10878-016-0056-2zbMath1383.05102OpenAlexW2460556441MaRDI QIDQ2410035

Fei Huang, Shujing Wang, Xue Liang Li

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0056-2

zbMATH Keywords

proper connection numberErdős-Gallai-type problembridge-block tree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (7)

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 ⋮ On the total proper connection of graphs ⋮ On strong proper connection number of cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow connection in 3-connected graphs
• A note on the minimum size of \(k\)-rainbow-connected graphs
• Rainbow connection of graphs with diameter 2
• Proper connection of graphs
• Proper connection numbers of complementary graphs
• Note on minimally \(d\)-rainbow connected graphs
• Rainbow connections of graphs: a survey
• On minimally rainbow \(k\)-connected graphs
• Proper connection with many colors
• Rainbow connection number of dense graphs
• Rainbow connection number and connected dominating sets
• The rainbow connectivity of a graph
• Graphs with rainbow connection number two
• Rainbow connection in graphs

This page was built for publication: Upper bounds of proper connection number of graphs