Proper connection number of random graphs
From MaRDI portal
Publication:897901
DOI10.1016/j.tcs.2015.10.017zbMath1331.05194arXiv1505.04646OpenAlexW1799905119MaRDI QIDQ897901
Ran Gu, Zhongmei Qin, Xue Liang Li
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.04646
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items (17)
On two conjectures about the proper connection number of graphs ⋮ Conflict-free connections of graphs ⋮ Coloring graphs to produce properly colored walks ⋮ Two sufficient conditions for 2-connected graphs to have proper connection number 2 ⋮ Conflict-free connection number of random graphs ⋮ Optimal proper connection of graphs ⋮ Minimum degree condition for proper connection number 2 ⋮ Hardness results for three kinds of colored connections of graphs ⋮ Some upper bounds for the 3-proper index of graphs ⋮ The \(k\)-proper index of graphs ⋮ The optimal proper connection number of a graph with given independence number ⋮ Graphs with conflict-free connection number two ⋮ On the total proper connection of graphs ⋮ The \((k,\ell )\)-proper index of graphs ⋮ Note on directed proper connection number of a random graph ⋮ On the (di)graphs with (directed) proper connection number two ⋮ On the (di)graphs with (directed) proper connection number two
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rainbow-\(k\)-connectivity of random graphs
- Proper connection of graphs
- On two Hamilton cycle problems in random graphs
- On rainbow connection
- Hamiltonian circuits in random graphs
- Rainbow connections of graphs: a survey
- Rainbow connection of sparse random graphs
- Properties of almost all graphs and complexes
- Rainbow connection in graphs
- Almost all regular graphs are hamiltonian
This page was built for publication: Proper connection number of random graphs
