An Eulerian exposition
From MaRDI portal
Recommendations
Cites work
- Bounds of the number of disjoint spanning trees
- Euler Graphs on Labelled Nodes
- Even circuits in planar graphs
- Flows and generalized coloring theorems in graphs
- Isographs and oriented isographs
- Maximum matching and a polyhedron with 0,1-vertices
- On Arbitrarily Traceable Graphs.
- On Spanning and Dominating Circuits in Graphs
Cited in
(21)- Exploring equivalent definitions of Eulerian graphs
- On existence of reporter strands in DNA-based graph structures
- scientific article; zbMATH DE number 1760759 (Why is no real title available?)
- Supereulerian graphs and excluded induced minors
- scientific article; zbMATH DE number 4106897 (Why is no real title available?)
- 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)
- scientific article; zbMATH DE number 4142070 (Why is no real title available?)
- scientific article; zbMATH DE number 4150213 (Why is no real title available?)
- Edge constrained Eulerian extensions
- Efficient algorithms for Eulerian extension
- scientific article; zbMATH DE number 3252407 (Why is no real title available?)
- Editing to Eulerian graphs
- Edge-matching problems with rotations
- A Morsel from Euler
- scientific article; zbMATH DE number 3946164 (Why is no real title available?)
- An alternating construction of graphs
- scientific article; zbMATH DE number 4116580 (Why is no real title available?)
- scientific article; zbMATH DE number 3974985 (Why is no real title available?)
- 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)