Pages that link to "Item:Q1938889"
From MaRDI portal
The following pages link to Rainbow connections of graphs: a survey (Q1938889):
Displaying 50 items.
- From colourful to rainbow paths in graphs: colouring the vertices (Q2051888) (← links)
- Conflict-free connection number and size of graphs (Q2051890) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (Q2082190) (← links)
- Rainbow and monochromatic vertex-connection of random graphs (Q2087672) (← links)
- Rainbow connectivity and rainbow criticality on graph classes (Q2091815) (← links)
- Bounds for the rainbow disconnection numbers of graphs (Q2115196) (← links)
- Some results on the total proper \(k\)-connection number (Q2135063) (← links)
- Upper bounding rainbow connection number by forest number (Q2138952) (← links)
- Some results on the 3-total-rainbow index (Q2141205) (← links)
- Distance-local rainbow connection number (Q2158184) (← links)
- More on the rainbow disconnection in graphs (Q2158198) (← links)
- The proper 2-connection number and size of graphs (Q2166240) (← links)
- Two sufficient conditions for 2-connected graphs to have proper connection number 2 (Q2186294) (← links)
- Conflict-free connection number of random graphs (Q2192106) (← links)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- Monochromatic disconnection of graphs (Q2208356) (← links)
- On proper (strong) rainbow connection of graphs (Q2227108) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
- Conflict-free vertex connection number at most 3 and size of graphs (Q2227116) (← links)
- Generalized rainbow connection of graphs (Q2239021) (← links)
- Multicolorful connectivity of trees (Q2242784) (← links)
- Proper connection and proper-walk connection of digraphs (Q2245028) (← links)
- The 3-rainbow index of a graph (Q2259571) (← links)
- Graphs with 3-rainbow index \(n-1\) and \(n-2\) (Q2259573) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- Total rainbow connection numbers of some special graphs (Q2279465) (← links)
- Conflict-free vertex-connections of graphs (Q2282464) (← links)
- More on the minimum size of graphs with given rainbow index (Q2282475) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph (Q2303722) (← links)
- Kaleidoscopic edge-coloring of complete graphs and \(r\)-regular graphs (Q2312066) (← links)
- Facial rainbow coloring of plane graphs (Q2312068) (← links)
- Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six (Q2337023) (← links)
- Graphs with 4-rainbow index 3 and \(n-1\) (Q2344025) (← links)
- Rainbow connection and forbidden subgraphs (Q2346333) (← links)
- Note on the hardness of rainbow connections for planar and line graphs (Q2350709) (← links)
- On two conjectures about the proper connection number of graphs (Q2359964) (← links)
- Total monochromatic connection of graphs (Q2374173) (← links)
- Rainbow connection number and graph operations (Q2399294) (← links)
- A note on the rainbow connection of random regular graphs (Q2401435) (← links)
- Proper connection and size of graphs (Q2401802) (← links)
- Graphs with small total rainbow connection number (Q2405975) (← links)
- 3-rainbow index and forbidden subgraphs (Q2409535) (← links)
- Upper bounds of proper connection number of graphs (Q2410035) (← links)
- Rainbow connection numbers of Cayley graphs (Q2410037) (← links)
- On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742) (← links)
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey (Q2422839) (← links)
- Minimum degree condition for proper connection number 2 (Q2424876) (← links)
- Upper bound involving parameter \(\sigma_2\) for the rainbow connection number (Q2439242) (← links)