Eulerian graphs and related topics. Part 1, Volume 2
From MaRDI portal
Publication:1188958
zbMath0792.05092MaRDI QIDQ1188958
Publication date: 17 September 1992
Published in: Annals of Discrete Mathematics (Search for Journal in Brave)
Related Items
Twisted duality for embedded graphs, On edge-path eigenvalues of graphs, Approximation algorithms for solving the constrained arc routing problem in mixed graphs, A 3/2-Approximation for the Metric Many-Visits Path TSP, Design formalism for DNA self-assembly of polyhedral skeletons using rigid tiles, A numbering of the vertices of special networks, Supereulerian graphs and excluded induced minors, Routing problems: A bibliography, Mathematical models and routing algorithms for CAD technological preparation of cutting processes, Chain sequences with ordered enclosing, The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable, On approximate data reduction for the Rural Postman Problem: Theory and experiments, The permutation-path coloring problem on trees., Odd Decompositions of Eulerian Graphs, Covering a graph with cycles., On the Query Complexity of Testing Orientations for Being Eulerian, Kotzig frames and circuit double covers, On the linear algebra of local complementation, Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem, A solution to a colouring problem of P. Erdős, Algorithm for identification of infinite clusters based on minimal finite automaton, DNA origami and the complexity of Eulerian circuits with turning costs, On the maximum edge-pair embedding bipartite matching, Uniquely decodable \(n\)-gram embeddings, Antiparallel \(d\)-stable traces and a stronger version of ore problem, Parallelism of stable traces, Walking through waypoints, Topology-hiding computation for networks with unknown delays, Unnamed Item, No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths, Exact Goodness‐of‐Fit Tests for Markov Chains, Antisymmetric flows and strong colourings of oriented graphs, On extremal graphs without compatible triangles or quadrilaterals
