Covering the edges of a graph by a prescribed tree with minimum overlap

DOI10.1006/jctb.1997.1768zbMath0906.05053OpenAlexW2095046926MaRDI QIDQ1386432

Yair Caro, Raphael Yuster, Noga Alon

Publication date: 1 February 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1768

zbMATH Keywords

overlapcoveringNP-complete

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item