The following pages link to (Q4358434):
Displaying 34 items.
- Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Cycles of given length in oriented graphs (Q965252) (← links)
- Hamiltonian degree sequences in digraphs (Q974465) (← 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 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)
- 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)
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs (Q2092426) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three (Q2124635) (← 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)
- On the number of alternating paths in random graphs (Q2231749) (← links)
- Symbolic coloured SCC decomposition (Q2233494) (← 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)
- Fork-forests in bi-colored complete bipartite graphs (Q2446314) (← 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)
- A Dirac Type Condition for Properly Coloured Paths and Cycles (Q5418769) (← links)
- Graph Tilings in Incompatibility Systems (Q6046822) (← links)
- Edge-disjoint properly colored cycles in edge-colored complete graphs (Q6126721) (← links)
