scientific article; zbMATH DE number 6475963
From MaRDI portal
Publication:5502386
Recommendations
- Spanning trails that join given edges in 3-edge-connected graphs.
- Spanning trails connecting given edges
- Spanning trails containing given edges
- On the path edge-connectivity of graphs.
- Spanning trails in essentially 4-edge-connected graphs
- scientific article; zbMATH DE number 27751
- Paths and edge-connectivity in graphs
- Spanning trails in a 2-connected graph
- scientific article; zbMATH DE number 3991542
- Spanning closed trails in graphs
Cited in
(6)- Spanning trails connecting 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
- Spanning trails that join given edges in 3-edge-connected graphs.
- Existence of spanning and dominating trails and circuits
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502386)