Spanning trails in essentially 4-edge-connected graphs
From MaRDI portal
Publication:741753
DOI10.1016/J.DAM.2013.08.041zbMATH Open1300.05154OpenAlexW2151916639MaRDI QIDQ741753FDOQ741753
Authors: D. Kharzeev 
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.041
Recommendations
Cites Work
- Graph theory
- Graphs without spanning closed trails
- A reduction method to find spanning Eulerian subgraphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- A note on graphs spanned by Eulerian graphs
- The spanning subgraphs of eulerian graphs
- Hamiltonian connectedness in 3-connected line graphs
- A Note on Sub-Eulerian Graphs
- Reflections on graph theory
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- Supereulerian graphs and the Petersen graph
- Spanning trails containing given edges
Cited In (11)
- Spanning trails that join given edges in 3-edge-connected graphs.
- Title not available (Why is that?)
- Strongly spanning trailable graphs in graph family \({C_2}\left ({4,k} \right)\)
- Spanning trails containing given edges
- Strengthened Ore conditions for \((s, t)\)-supereulerian graphs
- Title not available (Why is that?)
- On \(( s , t )\)-supereulerian graphs with linear degree bounds
- Polynomially determine if a graph is \((s,3)\)-supereulerian
- Extremal spectral radius and essential edge-connectivity
- Spanning trails in a 2-connected graph
- Supereulerian width of dense graphs
This page was built for publication: Spanning trails in essentially 4-edge-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741753)
