Rainbow Hamilton cycles in uniform hypergraphs
From MaRDI portal
Publication:426813
zbMath1243.05080MaRDI QIDQ426813
Andrzej Ruciński, Andrzej Dudek, Alan M. Frieze
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p46
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items
Rainbow Hamilton cycles and lopsidependency, Bounded colorings of multipartite graphs and hypergraphs, Efficiently list‐edge coloring multigraphs asymptotically optimally, Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree, Properly colored Hamilton cycles in Dirac-type hypergraphs, Recent advances on the Hamiltonian problem: survey III, A Rainbow Dirac's Theorem, On the number of alternating paths in random graphs, On the number of alternating paths in bipartite complete graphs, Extensions of results on rainbow Hamilton cycles in uniform hypergraphs