Recommendations
Cites work
- A Note on Sub-Eulerian Graphs
- A note on graphs spanned by Eulerian graphs
- A reduction method to find spanning Eulerian subgraphs
- Graphs without spanning closed trails
- On a closure concept in claw-free graphs
- On hamiltonian line graphs and connectivity
- Reflections on graph theory
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
Cited in
(12)- A note on the maximum number of edges of a spanning Eulerian subgraph.
- Super-Eulerian graphs and the Petersen graph. II
- Fan-type conditions for spanning Eulerian subgraphs
- scientific article; zbMATH DE number 2192202 (Why is no real title available?)
- On maximum number of edges in a spanning eulerian subgraph
- On finding spanning eulerian subgraphs
- Polynomially determine if a graph is \((s,3)\)-supereulerian
- Super 3-restricted edge connectivity of triangle-free graphs.
- Supereulerian 3-path-quasi-transitive digraphs
- scientific article; zbMATH DE number 1854059 (Why is no real title available?)
- Super \(\lambda_3\)-optimality of regular graphs
- Supereulerian graphs and the Petersen graph
This page was built for publication: On 3-edge-connected supereulerian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659686)
