Supereulerian graphs in the graph family C₂(6,k)
From MaRDI portal
Publication:628342
DOI10.1016/J.DAM.2010.12.005zbMATH Open1219.05086OpenAlexW2140599701MaRDI QIDQ628342FDOQ628342
Authors: Hong-Jian Lai, Yanting Liang 
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.005
Recommendations
- The supereulerian graphs in the graph family \(C(l,k)\)
- Supereulerian graphs and the Petersen graph
- scientific article; zbMATH DE number 26482
- Supereulerian graphs and the Petersen graph
- scientific article; zbMATH DE number 1369
- Super-Eulerian graphs and the Petersen graph. II
- Supereulerian graphs: A survey
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
- Publication:4731211
- On extremal \(k\)-supereulerian graphs
Cites Work
- Graph theory
- Graphs without spanning closed trails
- A reduction method to find spanning Eulerian subgraphs
- Decomposition of Finite Graphs Into Forests
- 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
- A Note on Sub-Eulerian Graphs
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Eulerian graphs and related topics. Part 1, Volume 1
- 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?)
Cited In (10)
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
- Supereulerian complementary graphs
- The supereulerian graphs in the graph family \(C(l,k)\)
- Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Spanning trails in essentially 4-edge-connected graphs
- Graphs with a 3-cycle-2-cover
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
- Spanning Eulerian subgraphs of 2-edge-connected graphs
- On extremal \(k\)-supereulerian graphs
This page was built for publication: Supereulerian graphs in the graph family \(C_{2}(6,k)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628342)
