Pages that link to "Item:Q1677578"

The following pages link to Properly coloured Hamiltonian cycles in edge-coloured complete graphs (Q1677578):

Displaying 24 items.

• Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
• Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
• Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
• Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
• Properly edge-colored theta graphs in edge-colored complete graphs (Q1733876) (← links)
• Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result (Q1981705) (← links)
• A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs (Q2012053) (← 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)
• Rainbow edge-pancyclicity of strongly edge-colored graphs (Q2077375) (← 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)
• Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
• Cycle extension in edge-colored complete graphs (Q2400555) (← 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)
• Acyclic Digraphs (Q3120435) (← links)
• Properly colored and rainbow copies of graphs with few cherries (Q5890911) (← links)
• Graph Tilings in Incompatibility Systems (Q6046822) (← links)
• Edge-disjoint properly colored cycles in edge-colored complete graphs (Q6126721) (← links)
• Compatible spanning circuits and forbidden induced subgraphs (Q6184989) (← links)