Spanning trails in essentially 4-edge-connected graphs
From MaRDI portal
(Redirected from Publication:741753)
Recommendations
Cites work
- A Note on Sub-Eulerian Graphs
- A note on graphs spanned by Eulerian graphs
- A reduction method to find spanning Eulerian subgraphs
- Graph theory
- Graphs without spanning closed trails
- Hamiltonian connectedness in 3-connected line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Reflections on graph theory
- Spanning trails containing given edges
- Supereulerian graphs and the Petersen graph
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- The spanning subgraphs of eulerian graphs
Cited in
(11)- Spanning trails that join given edges in 3-edge-connected graphs.
- scientific article; zbMATH DE number 6475963 (Why is no real title available?)
- 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
- On \(( s , t )\)-supereulerian graphs with linear degree bounds
- Polynomially determine if a graph is \((s,3)\)-supereulerian
- scientific article; zbMATH DE number 6890310 (Why is no real title available?)
- 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)
