Pages that link to "Item:Q4715273"
From MaRDI portal
The following pages link to Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP (Q4715273):
Displaying 14 items.
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs (Q1584322) (← links)
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs (Q2012053) (← links)
- On supereulerian 2-edge-coloured graphs (Q2053721) (← links)
- On connectivities of edge-colored graphs (Q2104926) (← links)
- Maximum colored trees in edge-colored graphs (Q2311375) (← links)
- Paths and trails in edge-colored graphs (Q2378531) (← links)
- Characterization of edge-colored complete graphs with properly colored Hamilton paths (Q3418198) (← links)
- Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
- (Q5061404) (← links)
- Paths and Trails in Edge-Colored Graphs (Q5458574) (← links)
- Proper‐walk connection number of graphs (Q6055386) (← links)
- Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375) (← links)
