Rainbow paths
From MaRDI portal
Recommendations
Cites work
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Expanders that beat the eigenvalue bound: Explicit construction and applications
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- scientific article; zbMATH DE number 1461254 (Why is no real title available?)
- scientific article; zbMATH DE number 5237337 (Why is no real title available?)
- Loss-less condensers, unbalanced expanders, and extractors
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- On rainbow connection
- Probability Inequalities for Sums of Bounded Random Variables
- Rainbow connection in graphs
- Randomness conductors and constant-degree lossless expanders
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The rainbow connectivities of small cubic graphs.
- The rainbow connectivity of a graph
Cited in
(9)- Optimal colorings with rainbow paths
- Proper connection of direct products
- Riordan paths and derangements
- Complete graphs with no rainbow path
- Total rainbow \(k\)-connection in graphs
- Rainbow path and color degree in edge colored graphs
- Proper connection of graphs
- The rainbow connectivity of Cartesian product graphs
- IPRainbow
This page was built for publication: Rainbow paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965956)