Proper connection of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5237337 (Why is no real title available?)
- A characterization of Hamiltonian prisms
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Color degree and alternating cycles in edge-colored graphs
- Cycles and paths in edge‐colored graphs with given degrees
- On minimally rainbow \(k\)-connected graphs
- On rainbow connection
- On relative length of longest paths and cycles
- Panconnected graphs. II
- Properly colored paths and cycles
- Rainbow connection in graphs
- Rainbow paths
- Relative length of long paths and cycles in graphs with large degree sums
- Some Theorems on Abstract Graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
Cited in
(87)- On radio connection number of graphs
- Proper connection with many colors
- Generalized rainbow connection of graphs
- Minimum degree condition for proper connection number 2
- On the total proper connection of graphs
- Characterizations of graphs having large proper connection numbers
- Number of proper paths in edge-colored hypercubes
- Minimum degree and size conditions for the proper connection number of graphs
- Relations of three classes of disconnected coloring
- On the (di)graphs with (directed) proper connection number two
- The proper diameter of a graph
- The proper 2-connection number and size of graphs
- Degree sums and proper connection number of graphs
- On the number of \(k\)-proper connected edge and vertex colorings of graphs
- Two sufficient conditions for 2-connected graphs to have proper connection number 2
- Multicolorful connectivity of trees
- Extremal stretch of proper-walk coloring of graphs
- On two conjectures about the proper connection number of graphs
- The \((k,\ell )\)-proper index of graphs
- Minimum degree conditions for the proper connection number of graphs
- Upper bounds of proper connection number of graphs
- (Strong) proper vertex connection of some digraphs
- On (strong) proper vertex-connection of graphs
- Some results on the total proper \(k\)-connection number
- Proper connection number of random graphs
- Proper connection number of bipartite graphs.
- Proper-walk connection of Hamiltonian digraphs
- The fine-grained complexity of approximately counting proper connected colorings (extended abstract)
- Proper connection of power graphs of finite groups
- Proper connection and proper-walk connection of digraphs
- Constraining MC-numbers by the connectivity of complement graphs
- Proper coloring distance in edge-colored Cartesian products of complete graphs and cycles
- Note on directed proper connection number of a random graph
- Connection graphs
- Some results on (strong) total proper connection number of some digraphs
- Digraphs with proper connection number two
- Note on minimum degree and proper connection number
- On Graphs with Proper Connection Number 2
- Strongly proper connected coloring of graphs
- Conflict-free connections of graphs
- The \(k\)-proper index of graphs
- (Strong) total proper connection of some digraphs
- Complexity results for two kinds of colored disconnections of graphs
- Proper disconnection of graphs
- Coloring graphs to produce properly colored walks
- Sharp Nordhaus-Gaddum-type lower bounds for proper connection numbers of graphs
- Graphs with conflict-free connection number two
- Some results on strong conflict-free connection number of graphs
- Note on vertex and total proper connection numbers
- Properly colored connectivity of graphs
- Upper bounds for the \(M D\)-numbers and characterization of extremal graphs
- The proper 2-connection number of several graph classes
- Conflict-free connection number and independence number of a graph
- Some upper bounds for the 3-proper index of graphs
- Conflict-free connection number and size of graphs
- Counting on rainbow \(k\)-connections
- Conflict-free connection number of random graphs
- Conflict-free vertex connection number at most 3 and size of graphs
- Odd connection and odd vertex-connection of graphs
- The proper vertex-disconnection of graphs
- (Strong) conflict-free connectivity: algorithm and complexity
- Strong conflict-free connection of graphs
- On the (di)graphs with (directed) proper connection number two
- (1, 2)-rainbow connection number at most 3 in connected dense graphs
- List proper connection of 2-edge-connected graphs
- Proper connection and size of graphs
- The proper (vertex) connection numbers of cubic graphs
- On color-connected graphs
- Bounds for proper \(k\)-connectivity of complete bipartite graphs
- A survey on conflict-free connection coloring of graphs
- The conflict-free vertex-connection number and degree conditions of graphs
- Proper connection of direct products
- On strong proper connection number of cubic graphs
- Optimal proper connection of graphs
- Proper‐walk connection number of graphs
- The optimal proper connection number of a graph with given independence number
- Hardness results for three kinds of colored connections of graphs
- On the minimum degree and the proper connection number of graphs
- Proper connection number 2, connectivity, and forbidden subgraphs
- Properly colored trails, paths, and bridges
- From colourful to rainbow paths in graphs: colouring the vertices
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)
- Proper connection numbers of complementary graphs
- Generalized rainbow connection of graphs and their complements
- Nordhaus-Gaddum-type theorem for total-proper connection number of graphs
- Proper connection number and connected dominating sets
- Loose edge-connection of graphs
This page was built for publication: Proper connection of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442366)
