Degree Bounded Forest Covering

DOI10.1007/978-3-642-20807-2_25zbMath1341.05210OpenAlexW13241059MaRDI QIDQ3009772

Lap Chi Lau, Tamás Király

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

matroidsparse graphsarboricityforest covering

Mathematics Subject Classification ID

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

Related Items (2)

Scheduling with interjob communication on parallel processors ⋮ Degree bounded matroids and submodular flows

Cites Work

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

This page was built for publication: Degree Bounded Forest Covering