On 3-edge-connected supereulerian graphs in graph family C(l,k)
From MaRDI portal
Publication:708409
Recommendations
Cites work
- scientific article; zbMATH DE number 4006296 (Why is no real title available?)
- scientific article; zbMATH DE number 3754754 (Why is no real title available?)
- scientific article; zbMATH DE number 26482 (Why is no real title available?)
- A note on graphs spanned by Eulerian graphs
- A note on minimum degree conditions for supereulerian graphs
- A reduction method to find spanning Eulerian subgraphs
- Contractions and hamiltonian line graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Graph theory
- Graphs without spanning closed trails
- On circuits and pancyclic line graphs
- Super-Eulerian graphs and the Petersen graph. II
- Super-Eulerian graphs of minimum degree at least \(4\).
- Supereulerian graphs and the Petersen graph
- Supereulerian graphs and the Petersen graph
- Supereulerian graphs: A survey
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
- The spanning subgraphs of eulerian graphs
- The supereulerian graphs in the graph family \(C(l,k)\)
Cited in
(9)- The supereulerian graphs in the graph family \(C(l,k)\)
- Lai's conditions for spanning and dominating closed trails
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- Super 3-restricted edge connectivity of triangle-free graphs.
- Spanning Eulerian subgraphs of 2-edge-connected graphs
- Super \(\lambda_3\)-optimality of regular graphs
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
- Catlin's reduced graphs with small orders
- Supereulerian 3-path-quasi-transitive digraphs
This page was built for publication: On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708409)