Eulerian graphs and related topics. Part 1, Volume 1
From MaRDI portal
Publication:1188656
zbMath0792.05091MaRDI QIDQ1188656
Publication date: 17 September 1992
Published in: Annals of Discrete Mathematics (Search for Journal in Brave)
Related Items (76)
Twisted duality for embedded graphs ⋮ On Finding Hamiltonian Cycles in Barnette Graphs ⋮ The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs ⋮ On graphic elementary lifts of graphic matroids ⋮ Design formalism for DNA self-assembly of polyhedral skeletons using rigid tiles ⋮ A lower bound for the connectivity of directed Euler tour transformation graphs ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ A numbering of the vertices of special networks ⋮ Dominating sets whose closed stars form spanning trees ⋮ Routing problems: A bibliography ⋮ Graphic and cographic \(\Gamma\)-extensions of binary matroids ⋮ Series parallel extensions of plane graphs to dual-Eulerian graphs ⋮ On semiextensions and circuit double covers ⋮ A forbidden-minor characterization for the class of regular matroids which yield the cographic es-splitting matroids ⋮ Pairs of trees in tree--tree triangulations ⋮ D-optimal input design for nonlinear FIR-type systems: a dispersion-based approach ⋮ The combinatorial complexity of a finite string ⋮ Parameterized complexity of connected even/odd subgraph problems ⋮ Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs ⋮ A note on the dual of the splitting matroid ⋮ Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture ⋮ Simplicity in Eulerian circuits: uniqueness and safety ⋮ Some results involving the splitting operation on binary matroids ⋮ Splitting lemma for 2-connected graphs ⋮ Modulo orientations with bounded out-degrees ⋮ Design methods for 3D wireframe DNA nanostructures ⋮ Inferring strings from position heaps in linear time ⋮ On conservative and supermagic graphs ⋮ Cographic splitting of graphic matroids using a set with three elements ⋮ Odd Decompositions of Eulerian Graphs ⋮ Tell me who you are friends with and I will tell you who you are: unique neighborhoods in random graphs ⋮ Supereulerian graphs in the graph family \(C_{2}(6,k)\) ⋮ The complexity of counting Eulerian tours in 4-regular graphs ⋮ Cell rotation graphs of strongly connected orientations of plane graphs with an application ⋮ On dual of the generalized splitting matroids ⋮ Unnamed Item ⋮ Short cycle covers of graphs with at most 77\% vertices of degree two ⋮ Unnamed Item ⋮ On the Query Complexity of Testing Orientations for Being Eulerian ⋮ Kotzig frames and circuit double covers ⋮ Splitting off operation for binary matroids and its applications ⋮ Finite automata for testing composition-based reconstructibility of sequences ⋮ On the linear algebra of local complementation ⋮ On \(k\)-connected \(\gamma\)-extensions of binary matroids ⋮ Signed Graphs: From Modulo Flows to Integer-Valued Flows ⋮ Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems ⋮ Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs ⋮ Forbidden-minors for graphic and cographic es-splitting matroids ⋮ On the excluded minors for regular matroids which yield cographic splitting matroids ⋮ Forbidden-minors for es-splitting binary gammoids ⋮ DNA origami and the complexity of Eulerian circuits with turning costs ⋮ Decompositions of infinite graphs. II: Circuit decompositions ⋮ Graphic splitting of cographic matroids ⋮ A characterization of n-connected splitting matroids ⋮ Antiparallel \(d\)-stable traces and a stronger version of ore problem ⋮ The characteristics of cycle-nodes-ratio and its application to network classification ⋮ Parallelism of stable traces ⋮ Two-factors in orientated graphs with forbidden transitions ⋮ An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width ⋮ Editing to Connected F-Degree Graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Straight-ahead walks in Eulerian graphs ⋮ A note on semiextensions of stable circuits ⋮ Hamiltonicity in vertex envelopes of plane cubic graphs ⋮ Circuit double covers in special types of cubic graphs ⋮ On \(n\)-connected splitting matroids ⋮ Splitting in a binary matroid ⋮ Hamilton cycles in tensor product of graphs ⋮ Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs ⋮ Integer Flows and Modulo Orientations of Signed Graphs ⋮ Cycle decompositions and constructive characterizations ⋮ Finding paths in graphs avoiding forbidden transitions ⋮ Determination of the bases of a splitting matroid ⋮ Spanning trails containing given edges
This page was built for publication: Eulerian graphs and related topics. Part 1, Volume 1
