On extremal k-supereulerian graphs
From MaRDI portal
Publication:383349
DOI10.1016/J.DISC.2013.09.003zbMATH Open1277.05104OpenAlexW2170782213MaRDI QIDQ383349FDOQ383349
Authors: Zhaohong Niu, Liang Sun, Hong-Jian Lai, Huiya Yan, Liming Xiong 
Publication date: 3 December 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.09.003
Recommendations
- Spectral and extremal conditions for supereulerian graphs
- Supereulerian graphs: A survey
- On the supereulerian index of a graph
- scientific article; zbMATH DE number 3885945
- scientific article; zbMATH DE number 1778387
- Supereulerian graphs and matchings
- Supereulerian graphs with constraints on the matching number and minimum degree
- The supereulerian graphs in the graph family \(C(l,k)\)
- scientific article; zbMATH DE number 554169
- Extremal problems concerning Kneser-graphs
Cites Work
- Graph theory with applications
- A reduction method to find spanning Eulerian subgraphs
- Maximum matching and a polyhedron with 0,1-vertices
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
- 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
- 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\).
- Even factor of a graph with a bounded number of components
- Title not available (Why is that?)
- Title not available (Why is that?)
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- Spanning subgraph with Eulerian components
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
Cited In (16)
- A note on the maximum number of edges of a spanning Eulerian subgraph.
- On (s,t)-supereulerian graphs in locally highly connected graphs
- A note on minimum degree conditions for supereulerian graphs
- Title not available (Why is that?)
- Forbidden pairs for connected even factors in supereulerian graphs
- Title not available (Why is that?)
- On \(( s , t )\)-supereulerian graphs with linear degree bounds
- Even factors with a bounded number of components in iterated line graphs
- Supereulerian line graphs
- Superextensions and the depth of median graphs
- Title not available (Why is that?)
- Supereulerian graphs and the Petersen graph
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- Supereulerian graphs and matchings
- Spectral and extremal conditions for supereulerian graphs
- Spanning subgraph with Eulerian components
This page was built for publication: On extremal \(k\)-supereulerian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383349)
