Minimum degree conditions for the proper connection number of graphs

DOI10.1007/s00373-017-1796-1zbMath1371.05153OpenAlexW2618308016MaRDI QIDQ2409521

Ingo Schiermeyer, Trung Duy Doan, Christoph Brause

Publication date: 11 October 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1796-1

zbMATH Keywords

minimum degree2-connected graphsproper connection number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Vertex degrees (05C07)

Related Items (13)

On two conjectures about the proper connection number of graphs ⋮ The proper 2-connection number and size of graphs ⋮ Degree sums and proper connection number of graphs ⋮ Two sufficient conditions for 2-connected graphs to have proper connection number 2 ⋮ The conflict-free vertex-connection number and degree conditions of graphs ⋮ Proper‐walk connection number of graphs ⋮ Optimal proper connection of graphs ⋮ Properly colored trails, paths, and bridges ⋮ The optimal proper connection number of a graph with given independence number ⋮ Graphs with conflict-free connection number two ⋮ Conflict-free connection number and independence number of a graph ⋮ On the (di)graphs with (directed) proper connection number two ⋮ NOTE ON MINIMUM DEGREE AND PROPER CONNECTION NUMBER

Cites Work

• Proper connection of graphs
• On the minimum degree and the proper connection number of graphs
• Long cycles in bipartite graphs
• A characterization of Hamiltonian prisms
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum degree conditions for the proper connection number of graphs