Publication:5538410
From MaRDI portal
zbMath0155.31901MaRDI QIDQ5538410
Publication date: 1968
Full work available at URL: https://eudml.org/doc/33972
Related Items
Hidden Hamiltonian Cycle Recovery via Linear Programming, An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width, Chinese postman problem on edge-colored multigraphs, Compatible Euler tours for transition systems in Eulerian graphs, Some algorithmic results for finding compatible spanning circuits in edge-colored graphs, Circle graphs and the cycle double cover conjecture, Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs, Maximum \((g,f)\)-factors of a general graph, Alternating Hamiltonian circuits in edge-coloured bipartite graphs, A characterisation of graphs having three pariwise compatible Euler tours, On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks, Alternating cycles and paths in edge-coloured multigraphs: A survey, Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs, Gene assembly through cyclic graph decomposition, Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems, DNA physical mapping and alternating Eulerian cycles in colored graphs, On supereulerian 2-edge-coloured graphs, Compatible spanning circuits in edge-colored graphs, Almost Eulerian compatible spanning circuits in edge-colored graphs, The salesman's improved tours for fundamental classes, Some conditions for the existence of Euler \(H\)-trails, Kreiszerlegungen 4-regulärer Graphen und das Vierfarbenproblem, A generalization of properly colored paths and cycles in edge-colored graphs, Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs, Compatible Hamilton cycles in random graphs, Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
Cites Work
