On 3-edge-connected supereulerian graphs in graph family C(l,k)
From MaRDI portal
Publication:708409
DOI10.1016/J.DISC.2010.05.021zbMATH Open1230.05189OpenAlexW2130910508MaRDI QIDQ708409FDOQ708409
Dengxin Li, Hong-Jian Lai, Xiao-Min Li
Publication date: 11 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.05.021
Cites Work
- Title not available (Why is that?)
- Graphs without spanning closed trails
- A reduction method to find spanning Eulerian subgraphs
- A note on graphs spanned by Eulerian graphs
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- The supereulerian graphs in the graph family \(C(l,k)\)
- A note on minimum degree conditions for supereulerian graphs
- Super-Eulerian graphs of minimum degree at least \(4\).
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
- Title not available (Why is that?)
- Title not available (Why is that?)
- On circuits and pancyclic line graphs
- Supereulerian graphs and the Petersen graph
- Supereulerian graphs and the Petersen graph
- Super-Eulerian graphs and the Petersen graph. II
- Title not available (Why is that?)
- Contractions and hamiltonian line graphs
Cited In (6)
- Super 3-restricted edge connectivity of triangle-free graphs.
- Supereulerian 3-path-quasi-transitive digraphs
- Catlin’s reduced graphs with small orders
- Super \(\lambda_3\)-optimality of regular graphs
- Lai's conditions for spanning and dominating closed trails
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
Recommendations
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)
