scientific article
From MaRDI portal
Publication:2829346
zbMath1347.05055MaRDI QIDQ2829346
Elliot Laforge, Ping Zhang, Chira Lumduanhom, Eric Andrews
Publication date: 27 October 2016
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
On two conjectures about the proper connection number of graphs ⋮ Characterizations of graphs having large proper connection numbers ⋮ Conflict-free connections of graphs ⋮ The proper 2-connection number and size of graphs ⋮ Proper connection number of bipartite graphs ⋮ Proper connection and size of graphs ⋮ Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles ⋮ Minimum degree conditions for the proper connection number of graphs ⋮ Upper bounds of proper connection number of graphs ⋮ The proper vertex-disconnection of graphs ⋮ On radio connection number of graphs ⋮ Coloring graphs to produce properly colored walks ⋮ Two sufficient conditions for 2-connected graphs to have proper connection number 2 ⋮ The conflict-free vertex-connection number and degree conditions of graphs ⋮ (1, 2)-rainbow connection number at most 3 in connected dense graphs ⋮ Conflict-free connection number of random graphs ⋮ Minimum degree condition for proper connection number 2 ⋮ On (strong) proper vertex-connection of graphs ⋮ Relations of three classes of disconnected coloring ⋮ Hardness results for three kinds of colored connections of graphs ⋮ Properly colored trails, paths, and bridges ⋮ Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) ⋮ Generalized rainbow connection of graphs and their complements ⋮ Some upper bounds for the 3-proper index of graphs ⋮ Proper connection number of graph products ⋮ Unnamed Item ⋮ Conflict-free vertex connection number at most 3 and size of graphs ⋮ The \(k\)-proper index of graphs ⋮ Generalized rainbow connection of graphs ⋮ Multicolorful connectivity of trees ⋮ Graphs with conflict-free connection number two ⋮ Minimum degree and size conditions for the proper connection number of graphs ⋮ On the total proper connection of graphs ⋮ Conflict-free connection number and independence number of a graph ⋮ The \((k,\ell )\)-proper index of graphs ⋮ Note on directed proper connection number of a random graph ⋮ Proper connection numbers of complementary graphs ⋮ The proper diameter of a graph ⋮ (Strong) conflict-free connectivity: algorithm and complexity ⋮ Strong conflict-free connection of graphs ⋮ The rainbow spanning forest problem ⋮ Complexity results for two kinds of colored disconnections of graphs ⋮ On the (di)graphs with (directed) proper connection number two ⋮ On the (di)graphs with (directed) proper connection number two ⋮ Conflict-free connection number and size of graphs ⋮ On strong proper connection number of cubic graphs ⋮ Proper connection of power graphs of finite groups ⋮ Some results on strong conflict-free connection number of graphs
This page was built for publication:
