On the minimum degree and the proper connection number of graphs
From MaRDI portal
Publication:510954
DOI10.1016/j.endm.2016.10.028zbMath1356.05074OpenAlexW2556031989MaRDI QIDQ510954
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
Publication date: 14 February 2017
Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.028
Related Items (4)
Minimum degree conditions for the proper connection number of graphs ⋮ The conflict-free vertex-connection number and degree conditions of graphs ⋮ Proper‐walk connection number of graphs ⋮ (1, 2)-rainbow connection number at most 3 in connected dense graphs
Cites Work
This page was built for publication: On the minimum degree and the proper connection number of graphs