Proper connection of graphs
From MaRDI portal
Publication:442366
DOI10.1016/j.disc.2011.09.003zbMath1246.05090OpenAlexW2083641445MaRDI QIDQ442366
Valentin Borozan, Aydin Gerek, Zsolt Tuza, Leandro Montero, Shinya Fujita, Colton Magnant, Yannis Manoussakis
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.003
Related Items
On two conjectures about the proper connection number of graphs ⋮ Some results on the total proper \(k\)-connection number ⋮ Proper-walk connection of Hamiltonian digraphs ⋮ Note on vertex and total 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 ⋮ Degree sums and proper connection number of graphs ⋮ Upper bounds for the \(M D\)-numbers and characterization of extremal graphs ⋮ Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles ⋮ Minimum degree conditions for the proper connection number of graphs ⋮ Proper connection of direct products ⋮ 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 ⋮ Proper‐walk connection number of graphs ⋮ (1, 2)-rainbow connection number at most 3 in connected dense graphs ⋮ (Strong) proper vertex connection of some digraphs ⋮ Conflict-free connection number of random graphs ⋮ Proper connection number and connected dominating sets ⋮ Optimal proper connection of graphs ⋮ Proper 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 ⋮ Loose edge-connection of graphs ⋮ Constraining MC-numbers by the connectivity of complement graphs ⋮ 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 ⋮ Nordhaus-Gaddum-type theorem for total-proper connection number of graphs ⋮ Some upper bounds for the 3-proper index of graphs ⋮ Unnamed Item ⋮ Conflict-free vertex connection number at most 3 and size of graphs ⋮ The \(k\)-proper index of graphs ⋮ The optimal proper connection number of a graph with given independence number ⋮ Generalized rainbow connection of graphs ⋮ Multicolorful connectivity of trees ⋮ Extremal stretch of proper-walk coloring of graphs ⋮ Proper connection number 2, connectivity, and forbidden subgraphs ⋮ On the minimum degree and the proper connection number of graphs ⋮ Proper connection and proper-walk connection of digraphs ⋮ 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 ⋮ Digraphs with proper connection number two ⋮ Odd connection and odd vertex-connection of graphs ⋮ (Strong) total proper connection of some digraphs ⋮ 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 ⋮ From colourful to rainbow paths in graphs: colouring the vertices ⋮ Conflict-free connection number and size of graphs ⋮ On strong proper connection number of cubic graphs ⋮ Proper connection of power graphs of finite groups ⋮ Number of proper paths in edge-colored hypercubes ⋮ NOTE ON MINIMUM DEGREE AND PROPER CONNECTION NUMBER ⋮ Some results on strong conflict-free connection number of graphs
Cites Work
- Unnamed Item
- Properly colored paths and cycles
- Rainbow paths
- On rainbow connection
- Color degree and alternating cycles in edge-colored graphs
- Panconnected graphs. II
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- On minimally rainbow \(k\)-connected graphs
- Cycles and paths in edge‐colored graphs with given degrees
- Rainbow connection in graphs
- On relative length of longest paths and cycles
- A characterization of Hamiltonian prisms
- Relative length of long paths and cycles in graphs with large degree sums
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- Some Theorems on Abstract Graphs
