Alternating Hamiltonian cycles
From MaRDI portal
Publication:1225065
DOI10.1007/BF02756791zbMath0325.05114OpenAlexW2084387411MaRDI QIDQ1225065
Publication date: 1976
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02756791
Related Items
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs, Properly coloured copies and rainbow copies of large graphs with small maximum degree, Paths and trails in edge-colored graphs, Alternating cycles and paths in edge-coloured multigraphs: A survey, Cycle extension in edge-colored complete graphs, Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles, Maximum properly colored trees in edge-colored graphs, Bounded colorings of multipartite graphs and hypergraphs, Properly coloured Hamiltonian paths in edge-coloured complete graphs, Properly coloured Hamiltonian cycles in edge-coloured complete graphs, Compatible spanning circuits in edge-colored graphs, Properly colored 2-factors of edge-colored complete bipartite graphs, Graph Tilings in Incompatibility Systems, Long directed rainbow cycles and rainbow spanning trees, Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs, Parallel connectivity in edge-colored complete graphs: complexity results, Properly colored Hamilton cycles in Dirac-type hypergraphs, Long properly colored cycles in edge colored complete graphs, Alternating cycles in edge-partitioned graphs, Properly colored and rainbow copies of graphs with few cherries, Almost Eulerian compatible spanning circuits in edge-colored graphs, Properly edge-colored theta graphs in edge-colored complete graphs, On the number of alternating paths in random graphs, Alternating Hamiltonian circuits in edge-coloured bipartite graphs, Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result, Compatible Hamilton cycles in Dirac graphs, A Dirac Type Condition for Properly Coloured Paths and Cycles, Links in edge-colored graphs, On the number of alternating paths in bipartite complete graphs, Cycles and paths in edge‐colored graphs with given degrees, A property of the colored complete graph, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP, Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs, Properly colored short cycles in edge-colored graphs, Compatible Hamilton cycles in random graphs, Properly Coloured Cycles and Paths: Results and Open Problems, Minimal colorings for properly colored subgraphs, Color degree and alternating cycles in edge-colored graphs, Alternating paths in edge-colored complete graphs, Edge-colored complete graphs with alternating cycles, Paths and trails in edge-colored weighted graphs, Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs, Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
Cites Work
