Higher edge-connectivities and tree decompositions in regular graphs

DOI10.1016/S0012-365X(99)00314-3MaRDI QIDQ1972147zbMATH OpenWikidataFDO

Authors Yanyan Li

Publication date 30 July 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(99)00314-3

zbMATH Keywords

\(r\)-edge-connectivityarboricityhamiltonian graphregular graphtree decomposition

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the tree number of regular graphs
• On smallest regular graphs with a given isopart
• Minimum degree and minimum number of edge-disjoint trees
• scientific article; zbMATH DE number 2147929
• scientific article; zbMATH DE number 1556750

Cited in

(2)

• Minimum degree and minimum number of edge-disjoint trees
• scientific article; zbMATH DE number 2147929 (Why is no real title available?)

This page was built for publication: Higher edge-connectivities and tree decompositions in regular graphs

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