Rainbow paths
From MaRDI portal
Publication:965956
DOI10.1016/J.DISC.2009.09.010zbMath1209.05128OpenAlexW2913611669MaRDI QIDQ965956
Colton Magnant, Domingos jun. Dellamonica, Daniel M. Martin
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.09.010
Related Items (5)
The rainbow connectivity of cartesian product graphs ⋮ Proper connection of direct products ⋮ Total rainbow \(k\)-connection in graphs ⋮ Rainbow connections of graphs: a survey ⋮ Proper connection of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rainbow connection
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- Expanders that beat the eigenvalue bound: Explicit construction and applications
- The rainbow connectivity of a graph
- Rainbow connection in graphs
- Randomness conductors and constant-degree lossless expanders
- Loss-less condensers, unbalanced expanders, and extractors
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: Rainbow paths