Proper connection number and connected dominating sets
From MaRDI portal
Publication:896128
DOI10.1016/j.tcs.2015.06.006zbMath1333.05227arXiv1501.05717OpenAlexW1929795508MaRDI QIDQ896128
Meiqin Wei, Xue Liang Li, Jun Yue
Publication date: 11 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.05717
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Vertex degrees (05C07)
Related Items (15)
On two conjectures about the proper connection number of graphs ⋮ Some results on the total proper \(k\)-connection number ⋮ Proper connection number of bipartite graphs ⋮ Two sufficient conditions for 2-connected graphs to have proper connection number 2 ⋮ Optimal proper connection of graphs ⋮ Minimum degree condition for proper connection number 2 ⋮ Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) ⋮ Some upper bounds for the 3-proper index of graphs ⋮ Proper connection number of graph products ⋮ The \(k\)-proper index of graphs ⋮ The optimal proper connection number of a graph with given independence number ⋮ The \((k,\ell )\)-proper index of graphs ⋮ On the (di)graphs with (directed) proper connection number two ⋮ On the (di)graphs with (directed) proper connection number two ⋮ On strong proper connection number of cubic graphs
Cites Work
This page was built for publication: Proper connection number and connected dominating sets
