Alternating Hamiltonian cycles
From MaRDI portal
Recommendations
- Long Alternating Cycles in Edge-Colored Complete Graphs
- Edge-colored complete graphs with alternating cycles
- Alternating hamiltonian cycles in two colored complete bipartite graphs
- Color degree and alternating cycles in edge-colored graphs
- Alternating Hamiltonian circuits in edge-coloured bipartite graphs
Cites work
Cited in
(53)- Almost Eulerian compatible spanning circuits in edge-colored graphs
- Bounded colorings of multipartite graphs and hypergraphs
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
- Properly edge-colored theta graphs in edge-colored complete graphs
- A property of the colored complete graph
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- Links in edge-colored graphs
- Paths and trails in edge-colored weighted graphs
- Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs
- A Dirac type condition for properly coloured paths and cycles
- Alternating plane graphs
- Minimal colorings for properly colored subgraphs
- Alternating paths in edge-colored complete graphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Paths and trails in edge-colored graphs
- Parallel connectivity in edge-colored complete graphs: complexity results
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
- Alternating hamiltonian cycles in two colored complete bipartite graphs
- Long Alternating Cycles in Edge-Colored Complete Graphs
- Compatible spanning circuits in edge-colored graphs
- On the number of alternating paths in bipartite complete graphs
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
- On cycles that alternate through selected sets of vertices
- Compatible Hamilton cycles in random graphs
- Edge-colored complete graphs with alternating cycles
- Color degree and alternating cycles in edge-colored graphs
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Properly coloured cycles and paths: Results and open problems
- On the number of alternating paths in random graphs
- Properly coloured copies and rainbow copies of large graphs with small maximum degree
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
- Properly colored 2-factors of edge-colored complete bipartite graphs
- Alternating Hamiltonian circuits in edge-coloured bipartite graphs
- Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
- Alternating cycles in edge-partitioned graphs
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
- Properly colored short cycles in edge-colored graphs
- Properly colored Hamilton cycles in Dirac-type hypergraphs
- Cycle extension in edge-colored complete graphs
- On the parallel complexity of the alternating Hamiltonian cycle problem
- Compatible powers of Hamilton cycles in dense graphs
- Properly coloured Hamiltonian paths in edge-coloured complete graphs
- Long directed rainbow cycles and rainbow spanning trees
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
- scientific article; zbMATH DE number 7641244 (Why is no real title available?)
- Maximum properly colored trees in edge-colored graphs
- The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
- Long properly colored cycles in edge colored complete graphs
- Cycles and paths in edge‐colored graphs with given degrees
- Graph Tilings in Incompatibility Systems
- Compatible Hamilton cycles in Dirac graphs
This page was built for publication: Alternating Hamiltonian cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1225065)
