Pages that link to "Item:Q3055905"
From MaRDI portal
The following pages link to Cycles and paths in edge‐colored graphs with given degrees (Q3055905):
Displaying 14 items.
- Proper connection of graphs (Q442366) (← links)
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
- Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069) (← links)
- A note on equitable Hamiltonian cycles (Q1983122) (← links)
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs (Q2012053) (← links)
- Paths and trails in edge-colored weighted graphs (Q2333812) (← links)
- Acyclicity in edge-colored graphs (Q2374151) (← links)
- Proper Hamiltonian cycles in edge-colored multigraphs (Q2397532) (← links)
- Proper Hamiltonian paths in edge-coloured multigraphs (Q2409503) (← links)
- Fork-forests in bi-colored complete bipartite graphs (Q2446314) (← links)
- Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
- A Dirac Type Condition for Properly Coloured Paths and Cycles (Q5418769) (← links)
- Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375) (← links)
