scientific article; zbMATH DE number 1556750

MaRDI QIDQ4526640zbMATH OpenFDO

Authors H. Assiyatun, Nicholas Wormald

Publication date 25 January 2001

zbMATH Keywords

arboricitydecompositionsforestsregular graphstrees

Mathematics Subject Classification ID

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

Recommendations

• Covering a graph by forests and a matching
• Covering planar graphs with forests
• On covering vertices of a graph by trees
• Covering a graph with a constrained forest (extended abstract)
• Covering planar graphs with forests, one having bounded maximum degree
• Covering planar graphs with forests, one having a bounded maximum degree
• Mixed covering arrays on graphs of small treewidth
• Edge covering pseudo-outerplanar graphs with forests
• Coverings of the vertices of a graph by small cycles
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

Cited in

(4)

• Covering planar graphs with forests
• Higher edge-connectivities and tree decompositions in regular graphs
• Degree bounded forest covering
• scientific article; zbMATH DE number 3941564 (Why is no real title available?)

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