The following pages link to Rainbow connection in graphs (Q3392716):
Displaying 50 items.
- Generalized rainbow connectivity of graphs (Q744052) (← links)
- Extremal graphs with maximum monochromatic connectivity (Q776294) (← links)
- Vertex-monochromatic connectivity of strong digraphs (Q776297) (← links)
- Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
- The rainbow vertex-disconnection in graphs (Q831025) (← links)
- Proper connection number and connected dominating sets (Q896128) (← links)
- Proper connection number of random graphs (Q897901) (← links)
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (Q898171) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- Rainbow paths (Q965956) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- Conflict-free connections of graphs (Q1656907) (← links)
- Rainbow disconnection in graphs (Q1656915) (← links)
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number (Q1656916) (← links)
- More on the colorful monochromatic connectivity (Q1684281) (← links)
- Rainbow vertex-connection and forbidden subgraphs (Q1692637) (← links)
- Total rainbow connection of digraphs (Q1693154) (← links)
- On (strong) proper vertex-connection of graphs (Q1695612) (← links)
- Rainbow vertex connection of digraphs (Q1698060) (← links)
- Strong rainbow connection in digraphs (Q1701123) (← links)
- Generalized rainbow connection of graphs and their complements (Q1708384) (← links)
- Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789) (← links)
- Some upper bounds for the 3-proper index of graphs (Q1714011) (← links)
- Proper connection number of graph products (Q1714046) (← links)
- The \(k\)-proper index of graphs (Q1734744) (← links)
- Hardness result for the total rainbow \(k\)-connection of graphs (Q1735420) (← links)
- Rainbow connection numbers of Cayley digraphs on abelian groups (Q1739982) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
- Rainbow connections in digraphs (Q1752466) (← links)
- Graphs with conflict-free connection number two (Q1756118) (← links)
- Odd connection and odd vertex-connection of graphs (Q1800421) (← links)
- Rainbow connectivity of Moore cages of girth 6 (Q1801053) (← links)
- Upper bounds for the rainbow connection numbers of line graphs (Q1926059) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Minimum degree and size conditions for the proper connection number of graphs (Q2010690) (← links)
- The (vertex-)monochromatic index of a graph (Q2012896) (← links)
- Rainbow connection and graph products (Q2014711) (← links)
- Some results on the 3-vertex-rainbow index of a graph (Q2021678) (← links)
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- Rainbow \(k\)-connectivity of random bipartite graphs (Q2025233) (← links)
- (Strong) total proper connection of some digraphs (Q2045035) (← links)
- Complexity results for two kinds of colored disconnections of graphs (Q2045036) (← links)
- Note on the vertex-rainbow index of a graph (Q2048994) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- From colourful to rainbow paths in graphs: colouring the vertices (Q2051888) (← links)
- Conflict-free connection number and size of graphs (Q2051890) (← links)
- Rainbow and monochromatic vertex-connection of random graphs (Q2087672) (← links)
- Rainbow connectivity and rainbow criticality on graph classes (Q2091815) (← links)
- On connectivities of edge-colored graphs (Q2104926) (← links)
- Bounds for the rainbow disconnection numbers of graphs (Q2115196) (← links)
