Pages that link to "Item:Q1842658"
From MaRDI portal
The following pages link to Alternating paths in edge-colored complete graphs (Q1842658):
Displaying 12 items.
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- Links in edge-colored graphs (Q966157) (← links)
- Packing problems in edge-colored graphs (Q1331890) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- On the tractability of shortest path problems in weighted edge-coloured graphs (Q1621167) (← links)
- Alternating kernels (Q1693142) (← links)
- On supereulerian 2-edge-coloured graphs (Q2053721) (← links)
- Maximum colored trees in edge-colored graphs (Q2311375) (← links)
- Paths and trails in edge-colored weighted graphs (Q2333812) (← links)
- Paths and trails in edge-colored graphs (Q2378531) (← links)
- On s-t paths and trails in edge-colored graphs (Q2840541) (← links)
- Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375) (← links)
