Spanning trails containing given edges
From MaRDI portal
Publication:817757
DOI10.1016/J.DISC.2005.10.022zbMATH Open1086.05045OpenAlexW2051936684MaRDI QIDQ817757FDOQ817757
Authors: Weiqi Luo, Zhi-Hong Chen, Wei-Guo Chen 
Publication date: 20 March 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.butler.edu/cgi/viewcontent.cgi?article=1144&context=facsch_papers
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
- Supereulerian graphs: A survey
- Bounds of the number of disjoint spanning trees
- A Note on Sub-Eulerian Graphs
- Eulerian graphs and related topics. Part 1, Volume 1
- Connectivity and edge-disjoint spanning trees
- Title not available (Why is that?)
- Eulerian subgraphs containing given edges
Cited In (15)
- A condition on Hamilton-connected line graphs
- Catlin's reduced graphs with small orders
- Title not available (Why is that?)
- An eulerian trail traversing specified edges in given order
- Spanning trails connecting given edges
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
- Spanning trails in essentially 4-edge-connected graphs
- Degree sum and Hamiltonian-connected line graphs
- 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
- An algorithm for an Eulerian trail traversing specified edges in given order
- Spanning trails in a 2-connected graph
- Supereulerian width of dense graphs
- Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments
This page was built for publication: Spanning trails containing given edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817757)
