Alternating Hamiltonian cycles

From MaRDI portal
Publication:1225065


DOI10.1007/BF02756791zbMath0325.05114MaRDI QIDQ1225065

Béla Bollobás, Paul Erdős

Publication date: 1976

Published in: Israel Journal of Mathematics (Search for Journal in Brave)


05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs


Related Items

Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP, A Dirac Type Condition for Properly Coloured Paths and Cycles, Properly colored and rainbow copies of graphs with few cherries, Edge-colored complete graphs with alternating cycles, Links in edge-colored graphs, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Color degree and alternating cycles in edge-colored graphs, Alternating cycles in edge-partitioned graphs, Alternating Hamiltonian circuits in edge-coloured bipartite graphs, A property of the colored complete graph, Alternating cycles and paths in edge-coloured multigraphs: A survey, Properly coloured Hamiltonian paths in edge-coloured complete graphs, Properly coloured Hamiltonian cycles in edge-coloured complete graphs, Alternating paths in edge-colored complete graphs, On the number of alternating paths in bipartite complete graphs, Extensions of results on rainbow Hamilton cycles in uniform hypergraphs, Paths and trails in edge-colored graphs, Cycle extension in edge-colored complete graphs, Bounded colorings of multipartite graphs and hypergraphs, Long properly colored cycles in edge colored complete graphs, Minimal colorings for properly colored subgraphs, Compatible Hamilton cycles in random graphs, Properly coloured copies and rainbow copies of large graphs with small maximum degree, Cycles and paths in edge‐colored graphs with given degrees, Properly Coloured Cycles and Paths: Results and Open Problems



Cites Work