Local spanning trees in graphs and hypergraphs decomposition with respect to edge connectivity

MaRDI QIDQ2741349zbMATH OpenFDO

Authors Matthias Kriesell

Publication date 23 September 2001

Full work available at URL http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3

zbMATH Keywords

connected spanning subhypergraphsedge-connectivityhypergraph decompositionspanning tree

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Hypergraphs (05C65) Programming involving graphs or networks (90C35)

Recommendations

• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
• Edge-disjoint trees containing some given vertices in a graph
• On low bound of degree sequences of spanning trees inK-edge-connected graphs
• \(k\)-connectivity and decomposition of graphs into forests

Cited in

(3)

• \(k\)-connectivity and decomposition of graphs into forests
• Edge-disjoint trees containing some given vertices in a graph
• Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs

This page was built for publication: Local spanning trees in graphs and hypergraphs decomposition with respect to edge connectivity

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