Pages that link to "Item:Q5408601"
From MaRDI portal
The following pages link to Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs (Q5408601):
Displaying 8 items.
- Edge-disjoint rainbow spanning trees in complete graphs (Q298338) (← links)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- On non-intersecting Eulerian circuits (Q1090338) (← links)
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems (Q1752690) (← links)
- 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)
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three (Q2960471) (← links)