The following pages link to (Q5538410):
Displayed 26 items.
- Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
- Compatible Euler tours for transition systems in Eulerian graphs (Q580368) (← links)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Circle graphs and the cycle double cover conjecture (Q1025572) (← links)
- Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs (Q1168977) (← links)
- Maximum \((g,f)\)-factors of a general graph (Q1179272) (← links)
- Alternating Hamiltonian circuits in edge-coloured bipartite graphs (Q1186314) (← links)
- A characterisation of graphs having three pariwise compatible Euler tours (Q1264154) (← links)
- On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks (Q1351611) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs (Q1584322) (← links)
- Gene assembly through cyclic graph decomposition (Q1605478) (← links)
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems (Q1752690) (← links)
- DNA physical mapping and alternating Eulerian cycles in colored graphs (Q1902468) (← links)
- On supereulerian 2-edge-coloured graphs (Q2053721) (← links)
- Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
- Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
- The salesman's improved tours for fundamental classes (Q2227538) (← links)
- Some conditions for the existence of Euler \(H\)-trails (Q2334082) (← links)
- Kreiszerlegungen 4-regulärer Graphen und das Vierfarbenproblem (Q2553444) (← links)
- A generalization of properly colored paths and cycles in edge-colored graphs (Q2682924) (← links)
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs (Q2687939) (← links)
- Compatible Hamilton cycles in random graphs (Q2830238) (← links)
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three (Q2960471) (← links)
- Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
- An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121) (← links)