Degree bounded forest covering

DOI10.1007/978-3-642-20807-2_25MaRDI QIDQ3009772zbMATH OpenOpenAlexFDO

Authors Tamás Király, Lap Chi Lau

Publication date 24 June 2011

Published in Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL http://real.mtak.hu/20825/1/egres-10-08.pdf

zbMATH Keywords

arboricityforest coveringmatroidsparse graphs

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1556750
• Covering a graph by forests and a matching
• Covering planar graphs with forests
• scientific article; zbMATH DE number 566421
• Decompositions of graphs into forests with bounded maximum degree

Cites work

• Covering a graph by forests and a matching
• Covering planar graphs with forests, one having bounded maximum degree
• Decomposing a planar graph with girth 9 into a forest and a matching
• Decomposition of Finite Graphs Into Forests
• Decomposition of sparse graphs into forests and a graph with bounded degree
• Decomposition of sparse graphs, with application to game coloring number
• Degree Bounded Matroids and Submodular Flows

Cited in

(3)

• Scheduling with interjob communication on parallel processors
• Degree bounded matroids and submodular flows
• scientific article; zbMATH DE number 1222606 (Why is no real title available?)

This page was built for publication: Degree bounded forest covering

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