Pages that link to "Item:Q1221118"

The following pages link to Graphs with cycles having adjacent lines different colors (Q1221118):

Displaying 18 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)
• 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)
• A property of the colored complete graph (Q1253666) (← 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 cycles in edge-coloured complete graphs (Q1677578) (← links)
• Properly edge-colored theta graphs in edge-colored complete graphs (Q1733876) (← 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)
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles (Q2312662) (← links)
• Properly colored Hamilton cycles in Dirac-type hypergraphs (Q2692184) (← links)
• Compatible Hamilton cycles in random graphs (Q2830238) (← links)