Rainbow and orthogonal paths in factorizations ofKn

DOI10.1002/jcd.20243zbMath1216.05112WikidataQ114236278 ScholiaQ114236278MaRDI QIDQ3576975

Mehdi Mhalla, András Gyárfás

Publication date: 3 August 2010

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20243

zbMATH Keywords

factorizations of complete graphs; rainbow and orthogonal paths

Mathematics Subject Classification ID

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Color degree condition for long rainbow paths in edge-colored graphs, Hamilton transversals in random Latin squares, Rainbow path and color degree in edge colored graphs, Rainbow Turán problems for paths and forests of stars, Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles, Embedding rainbow trees with applications to graph labelling and decomposition, Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs, Long rainbow paths and rainbow cycles in edge colored graphs. A survey, Almost all optimally coloured complete graphs contain a rainbow Hamilton path

Cites Work

• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• One-factorizations of the complete graph—A survey
• A lower bound for the length of a partial transversal in a Latin square
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item