Spanning trails connecting given edges

DOI10.1007/S00373-004-0579-7zbMATH Open1061.05054OpenAlexW1984128589MaRDI QIDQ1777232FDOQ1777232

Authors: Hong-Jian Lai, Xiangwen Li, Hoifung Poon, Yongbin Ou 

Publication date: 12 May 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0579-7

Recommendations

• Spanning trails that join given edges in 3-edge-connected graphs.
• Spanning trails containing given edges
• scientific article; zbMATH DE number 867689
• scientific article; zbMATH DE number 734473
• scientific article; zbMATH DE number 6475963

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cited In (13)

• 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)\)
• An eulerian trail traversing specified edges in given order
• Title not available (Why is that?)
• On \(s\)-Hamiltonian line graphs of claw-free graphs
• Hamiltonian connected hourglass free line graphs
• Spanning trails in essentially 4-edge-connected graphs
• Spanning trails containing given edges
• Spanning trails in a 2-connected graph
• A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
• Spanning closed trails in graphs
• Spanning trails with variations of Chvátal-Erdős conditions

This page was built for publication: Spanning trails connecting given edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777232)