The following pages link to Alternating Hamiltonian cycles (Q1225065):
Displayed 44 items.
- Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
- Edge-colored complete graphs with alternating cycles (Q788736) (← links)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Links in edge-colored graphs (Q966157) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Color degree and alternating cycles in edge-colored graphs (Q1043956) (← links)
- Alternating cycles in edge-partitioned graphs (Q1167184) (← links)
- Alternating Hamiltonian circuits in edge-coloured bipartite graphs (Q1186314) (← links)
- A property of the colored complete graph (Q1253666) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- Properly coloured Hamiltonian paths in edge-coloured complete graphs (Q1383382) (← links)
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs (Q1677578) (← links)
- Properly edge-colored theta graphs in edge-colored complete graphs (Q1733876) (← links)
- Alternating paths in edge-colored complete graphs (Q1842658) (← links)
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result (Q1981705) (← links)
- On the number of alternating paths in bipartite complete graphs (Q2014212) (← links)
- Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs (Q2057600) (← links)
- Properly colored short cycles in edge-colored graphs (Q2065117) (← links)
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs (Q2092426) (← links)
- Maximum properly colored trees in edge-colored graphs (Q2168717) (← links)
- Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
- Long directed rainbow cycles and rainbow spanning trees (Q2189824) (← links)
- Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
- On the number of alternating paths in random graphs (Q2231749) (← links)
- Paths and trails in edge-colored weighted graphs (Q2333812) (← links)
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (Q2345522) (← links)
- Paths and trails in edge-colored graphs (Q2378531) (← links)
- Cycle extension in edge-colored complete graphs (Q2400555) (← links)
- Bounded colorings of multipartite graphs and hypergraphs (Q2403698) (← links)
- Long properly colored cycles in edge colored complete graphs (Q2440943) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles (Q2656965) (← links)
- Properly colored 2-factors of edge-colored complete bipartite graphs (Q2675853) (← links)
- Properly colored Hamilton cycles in Dirac-type hypergraphs (Q2692184) (← links)
- Compatible Hamilton cycles in random graphs (Q2830238) (← links)
- Properly coloured copies and rainbow copies of large graphs with small maximum degree (Q2904592) (← links)
- Cycles and paths in edge‐colored graphs with given degrees (Q3055905) (← links)
- Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP (Q4715273) (← links)
- A Dirac Type Condition for Properly Coloured Paths and Cycles (Q5418769) (← links)
- Properly colored and rainbow copies of graphs with few cherries (Q5890911) (← links)
- Graph Tilings in Incompatibility Systems (Q6046822) (← links)
- Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs (Q6143690) (← links)
- Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375) (← links)