An Eulerian exposition
From MaRDI portal
DOI10.1002/JGT.3190100306zbMATH Open0717.05054OpenAlexW2034363746MaRDI QIDQ3204499FDOQ3204499
Linda Lesniak, Ortrud R. Oellermann
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100306
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Maximum matching and a polyhedron with 0,1-vertices
- Flows and generalized coloring theorems in graphs
- Bounds of the number of disjoint spanning trees
- On Spanning and Dominating Circuits in Graphs
- Even circuits in planar graphs
- Isographs and oriented isographs
- Euler Graphs on Labelled Nodes
- On Arbitrarily Traceable Graphs.
Cited In (20)
- Efficient Algorithms for Eulerian Extension
- Edge-Matching Problems with Rotations
- On existence of reporter strands in DNA-based graph structures
- Title not available (Why is that?)
- Supereulerian graphs and excluded induced minors
- Title not available (Why is that?)
- A new view on rural postman based on Eulerian extension and matching
- A survey of parameterized algorithms and the complexity of edge modification
- (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge constrained Eulerian extensions
- Title not available (Why is that?)
- Editing to Eulerian graphs
- A Morsel from Euler
- Title not available (Why is that?)
- An alternating construction of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A special construction of complete Euler graphs
This page was built for publication: An Eulerian exposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204499)
