Pages that link to "Item:Q2182217"
From MaRDI portal
The following pages link to Compatible spanning circuits in edge-colored graphs (Q2182217):
Displayed 5 items.
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- On supereulerian 2-edge-coloured graphs (Q2053721) (← links)
- Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles (Q2656965) (← links)
- Compatible spanning circuits and forbidden induced subgraphs (Q6184989) (← links)