Pages that link to "Item:Q2960471"
From MaRDI portal
The following pages link to Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three (Q2960471):
Displaying 8 items.
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← 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)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees (Q5139656) (← links)
- Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs (Q5408601) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs (Q6100615) (← links)