Pages that link to "Item:Q3972517"
From MaRDI portal
The following pages link to \(P(D)\)-compatible Eulerian trails in digraphs and a new splitting lemma (Q3972517):
Displaying 9 items.
- Transforming eulerian trails (Q686289) (← links)
- 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)
- 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)
- Circular flows of nearly Eulerian graphs and vertex-splitting (Q3150192) (← links)
- Nowhere‐zero 3‐flows in products of graphs (Q5318243) (← links)
- Compatible spanning circuits and forbidden induced subgraphs (Q6184989) (← links)