A discharging method to find subgraphs having two edge-disjoint spanning trees.

MaRDI QIDQ5206367zbMATH OpenFDO

Authors Mingquan Zhan, Hong-Jian Lai, Ke-ke Wang

Publication date 18 December 2019

zbMATH Keywords

line graphedge-disjoint spanning treesHamiltonian connected graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
• Spanning tree packing and 2-essential edge-connectivity
• Edge‐disjoint spanning trees: A connectedness theorem
• Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
• Edge-disjoint trees containing some given vertices in a graph

Cited in

(1)

• Edge-disjoint spanning trees and the number of maximum state circles of a graph

This page was built for publication: A discharging method to find subgraphs having two edge-disjoint spanning trees.

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