Pages that link to "Item:Q2219966"
From MaRDI portal
The following pages link to Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966):
Displaying 10 items.
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Compatible Eulerian circuits in \(K_ n^{**}\) (Q1842648) (← links)
- Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles (Q2656965) (← links)
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three (Q2960471) (← links)
- Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs (Q5408601) (← links)
- Compatible spanning circuits and forbidden induced subgraphs (Q6184989) (← links)
- Trails in arc-colored digraphs avoiding forbidden transitions (Q6561576) (← links)
- Euler dynamic <i>H</i> -trails in edge-colored graphs (Q6651158) (← links)
- Dynamic cycles in edge-colored multigraphs (Q6660053) (← links)