Pages that link to "Item:Q1845739"

The following pages link to Graphs with Hamiltonian cycles having adjacent lines different colours (Q1845739):

Displaying 35 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)
• Color degree and alternating cycles in edge-colored graphs (Q1043956) (← links)
• Alternating cycles in edge-partitioned graphs (Q1167184) (← links)
• Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs (Q1168977) (← links)
• Alternating Hamiltonian circuits in edge-coloured bipartite graphs (Q1186314) (← links)
• On a problem of C. C. Chen and D. E. Daykin (Q1226504) (← links)
• On the structure of complete graphs without alternating cycles (Q1257026) (← links)
• On extremal graphs without compatible triangles or quadrilaterals (Q1322244) (← 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)
• 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)
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three (Q2124635) (← links)
• Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
• Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
• Extending perfect matchings to Hamiltonian cycles in line graphs (Q2223459) (← links)
• On the number of alternating paths in random graphs (Q2231749) (← links)
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles (Q2312662) (← links)
• Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (Q2345522) (← 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)
• 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)
• Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP (Q4715273) (← links)
• Properly colored and rainbow copies of graphs with few cherries (Q5890911) (← links)
• Graph Tilings in Incompatibility Systems (Q6046822) (← links)
• Proper‐walk connection number of graphs (Q6055386) (← links)