Supereulerianity of k-edge-connected graphs with a restriction on small bonds
From MaRDI portal
Publication:968110
Recommendations
Cites work
- A Note on Sub-Eulerian Graphs
- A note on minimum degree conditions for supereulerian graphs
- A reduction method to find spanning Eulerian subgraphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Even factor of a graph with a bounded number of components
- Graph theory
- Graphs without spanning closed trails
- Spanning subgraph with Eulerian components
- Super-Eulerian graphs of minimum degree at least \(4\).
- Supereulerian graphs and the Petersen graph
- Supereulerian graphs: A survey
- The supereulerian graphs in the graph family \(C(l,k)\)
Cited in
(9)- The supereulerian graphs in the graph family \(C(l,k)\)
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- Super-Eulerian graphs of minimum degree at least \(4\).
- Spanning Eulerian subgraphs of 2-edge-connected graphs
- On extremal \(k\)-supereulerian graphs
- Supereulerian width of dense graphs
- Graphs with a 3-cycle-2-cover
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
- Catlin's reduced graphs with small orders
This page was built for publication: Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968110)