Spanning trails containing given edges

DOI10.1016/J.DISC.2005.10.022MaRDI QIDQ817757zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Eulerian connectivity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Recommendations

• Spanning trails connecting given edges
• Spanning trails that join given edges in 3-edge-connected graphs.
• A charcterization of 4‐edge‐connected eulerian graphs
• Spanning trails in essentially 4-edge-connected graphs
• scientific article; zbMATH DE number 734473

Cites work

• scientific article; zbMATH DE number 3987316 (Why is no real title available?)
• A Note on Sub-Eulerian Graphs
• A reduction method to find spanning Eulerian subgraphs
• Bounds of the number of disjoint spanning trees
• Connectivity and edge-disjoint spanning trees
• Eulerian graphs and related topics. Part 1, Volume 1
• Eulerian subgraphs containing given edges
• Graph theory
• Graphs without spanning closed trails
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Supereulerian graphs: A survey

Cited in

(15)

• A condition on Hamilton-connected line graphs
• Catlin's reduced graphs with small orders
• scientific article; zbMATH DE number 6475963 (Why is no real title available?)
• 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)