Pages that link to "Item:Q1188958"
From MaRDI portal
The following pages link to Eulerian graphs and related topics. Part 1, Volume 2 (Q1188958):
Displaying 36 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Chain sequences with ordered enclosing (Q367978) (← links)
- Kotzig frames and circuit double covers (Q658033) (← links)
- On the linear algebra of local complementation (Q665929) (← links)
- Uniquely decodable \(n\)-gram embeddings (Q706633) (← links)
- Eulerian graphs and related topics. Part 1, Volume 1 (Q1188656) (← links)
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem (Q1197011) (← links)
- A solution to a colouring problem of P. Erdős (Q1197012) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- On extremal graphs without compatible triangles or quadrilaterals (Q1322244) (← links)
- A numbering of the vertices of special networks (Q1356750) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- Covering a graph with cycles. (Q1406651) (← links)
- Supereulerian graphs and excluded induced minors (Q1903724) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Algorithm for identification of infinite clusters based on minimal finite automaton (Q1993194) (← links)
- DNA origami and the complexity of Eulerian circuits with turning costs (Q2003481) (← links)
- Antiparallel \(d\)-stable traces and a stronger version of ore problem (Q2014350) (← links)
- Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957) (← links)
- Mathematical models and routing algorithms for CAD technological preparation of cutting processes (Q2399751) (← links)
- Special issue on Euler and Venn diagrams: Guest editors' introduction (Q2629216) (← links)
- Design formalism for DNA self-assembly of polyhedral skeletons using rigid tiles (Q2636439) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- Exact goodness-of-fit tests for Markov chains (Q2846457) (← links)
- Twisted duality for embedded graphs (Q2880690) (← links)
- An Eulerian exposition (Q3204499) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
- On edge-path eigenvalues of graphs (Q5043678) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- Parallelism of stable traces (Q5198033) (← links)
- Odd Decompositions of Eulerian Graphs (Q5357956) (← links)
- (Q5708525) (← links)
- On the maximum edge-pair embedding bipartite matching (Q5918365) (← links)
- Walking through waypoints (Q5918830) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
