scientific article; zbMATH DE number 3249675
From MaRDI portal
Publication:5538410
zbMath0155.31901MaRDI QIDQ5538410
Publication date: 1968
Full work available at URL: https://eudml.org/doc/33972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (31)
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs ⋮ On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ DNA physical mapping and alternating Eulerian cycles in colored graphs ⋮ Compatible spanning circuits in edge-colored graphs ⋮ Graph Tilings in Incompatibility Systems ⋮ Sorting genomes by prefix double-cut-and-joins ⋮ A generalization of properly colored paths and cycles in edge-colored graphs ⋮ Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three ⋮ Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Unnamed Item ⋮ Hidden Hamiltonian Cycle Recovery via Linear Programming ⋮ Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ The salesman's improved tours for fundamental classes ⋮ Maximum \((g,f)\)-factors of a general graph ⋮ Alternating Hamiltonian circuits in edge-coloured bipartite graphs ⋮ Chinese postman problem on edge-colored multigraphs ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems ⋮ Compatible Euler tours for transition systems in Eulerian graphs ⋮ An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width ⋮ A characterisation of graphs having three pariwise compatible Euler tours ⋮ On supereulerian 2-edge-coloured graphs ⋮ Circle graphs and the cycle double cover conjecture ⋮ Compatible Hamilton cycles in random graphs ⋮ Kreiszerlegungen 4-regulärer Graphen und das Vierfarbenproblem ⋮ Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs ⋮ Some conditions for the existence of Euler \(H\)-trails ⋮ Gene assembly through cyclic graph decomposition
Cites Work
This page was built for publication:
