Author:
Krivelevich Michael,Lee Choongbum,Sudakov Benny
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference22 articles.
1. N. Alon and G. Gutin: Properly colored Hamilton cycles in edge-colored complete graphs, Random Struct. Algor.
11 (1997), 179–186.
2. B. Bollobás and P. Erdős: Alternating hamiltonian cycles, Israel J. Math.
23 (1976), 126–131.
3. J. Bondy: Paths and cycles, in: Handbook of Combinatorics, Vol. 1 (edited by R. Graham, M. Grotschel, and L. Lovász), Elsevier, Amsterdam (1995), 5–110.
4. J. Böttcher, M. Schacht and A. Taraz: Proof of the bandwidth conjecture of Bollobás and Komlós, Mathematische Annalen
343 (2009), 175–205.
5. C. Chen and D. Daykin: Graphs with Hamiltonian cycles having adjacent lines different colors, J. Combin. Theory B
21 (1976), 135–139.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Counting oriented trees in digraphs with large minimum semidegree;Journal of Combinatorial Theory, Series B;2024-09
2. Graph Tilings in Incompatibility Systems;SIAM Journal on Discrete Mathematics;2023-08-29
3. Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs;The Electronic Journal of Combinatorics;2023-03-10
4. A Rainbow Dirac's Theorem;SIAM Journal on Discrete Mathematics;2020-01
5. Rainbow matchings in Dirac bipartite graphs;Random Structures & Algorithms;2019-01-15