Pages that link to "Item:Q830935"
From MaRDI portal
The following pages link to Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935):
Displaying 4 items.
- Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
- Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs (Q2687939) (← links)
- Compatible spanning circuits and forbidden induced subgraphs (Q6184989) (← links)