scientific article; zbMATH DE number 867689

MaRDI QIDQ4873803zbMATH OpenFDO

Authors Paul A. Catlin, Hong-Jian Lai

Publication date 21 April 1996

zbMATH Keywords

edge cutedge-disjoint spanning treesHamiltonian line graphspanning Eulerian subgraphspanning trail

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Spanning trails that join given edges in 3-edge-connected graphs.
• Spanning trails connecting given edges
• Graphs without spanning closed trails

Cited in

(18)

• Edge-connectivity and edge-disjoint spanning trees
• Hamiltonian connectedness in 3-connected line graphs
• Graphs without spanning closed trails
• Packing spanning trees in highly essentially connected graphs
• Degree sum and Hamiltonian-connected line graphs
• Every 3-connected essentially 10-connected line graph is Hamilton-connected
• Spanning trails connecting given edges
• Spanning tree packing and 2-essential edge-connectivity
• Complete family reduction and spanning connectivity in line graphs
• A condition on Hamilton-connected line graphs
• Chvátal-Erdős conditions and almost spanning trails
• Spanning trails in a 2-connected graph
• Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
• On spanning disjoint paths in line graphs
• Spanning trails that join given edges in 3-edge-connected graphs.
• Spanning connectivity in graphs and line graphs with Chvátal-Erdős conditions
• Spanning trails in essentially 4-edge-connected graphs
• On \(s\)-Hamiltonian-connected line graphs

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 Q4873803)