Pages that link to "Item:Q4358434"
From MaRDI portal
The following pages link to Properly colored Hamilton cycles in edge-colored complete graphs (Q4358434):
Displaying 50 items.
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
- Polychromatic Hamilton cycles (Q685588) (← links)
- What must and what need not be contained in a graph of uncountable chromatic number? (Q794660) (← links)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles (Q949803) (← 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)
- Multicolored parallelisms of Hamiltonian cycles (Q1044961) (← 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)
- Multicoloured Hamilton cycles (Q1890827) (← links)
- A note on equitable Hamiltonian cycles (Q1983122) (← links)
- On the number of alternating paths in bipartite complete graphs (Q2014212) (← links)
- Edge-colored complete graphs containing no properly colored odd cycles (Q2045403) (← links)
- Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs (Q2057600) (← links)
- Disjoint properly colored cycles in edge-colored complete bipartite graphs (Q2092322) (← links)
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs (Q2092426) (← links)
- \(H\)-cycles in \(H\)-colored multigraphs (Q2117527) (← 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)
- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← links)
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (Q2345522) (← links)
- Bounded colorings of multipartite graphs and hypergraphs (Q2403698) (← links)
- Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs (Q2422235) (← 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)
- Cycles avoiding a color in colorful graphs (Q2800592) (← 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)
- Hamilton circuits with many colours in properly edge-coloured complete graphs. (Q3816096) (← links)
- Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles (Q4638651) (← links)
- Cycles of given color patterns (Q4865523) (← links)
- (Q5094123) (← 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)
