Weedless Gardening
Autor Lee Reichen Limba Engleză Paperback – 23 mai 2001
"The Weedless Garden" is good for plants and it's good for people. It protects the soil, contributes to plant health, reduces water needs, cuts down on a gardener's labor, encourages earthworms and, of course, mitigates weed problems by keeping the seeds dormant. Four basic tenets form the system's backbone-minimize soil disruption; protect soil surface; avoid soil compaction; use drip irrigation-and the way to get there is simple. For a new bed or established garden, layering is key, and the perfect material to use is also among the most common-newspaper. Add organic mulch and compost on top, and plants are growing in rich, self-generating humus. From vegetable gardening to flower gardens to planting trees, shrubs, and vines, "The Weedless Garden" works everywhere-allowing the gardener to work quite a bit less.
Preț: 50.22 lei
Preț vechi: 64.10 lei
-22% Nou
9.61€ • 9.98$ • 7.98£
Carte disponibilă
Livrare economică 13-27 ianuarie 25
Specificații
ISBN-10: 0761116966
Pagini: 200
Ilustrații: colour illustrations
Dimensiuni: 152 x 202 x 14 mm
Greutate: 0.32 kg
Editura: Workman Publishing
Locul publicării:United States
Textul de pe ultima copertă
"Thoroughly practical, easy-to-follow guide to good gardening Lee Reich make it sound simple, and if you follow his methods and philosophy, it is." (Dora Galitzki, Gardening Columnist, The New York Times, and Author of The Gardener's Essential Companion)
"Finally, a book filled with science-based information that insures success and frees us from busywork in the garden." (Dr. H. March Cathey, President Emeritus, American Horticultural Society)
Turning conventional wisdom on its head, Lee Reich shows how to garden for plants and good for people. Eschewing the traditional yearly digging up and working over of the soil, WEEDLESS GARDENING is an easy-to-follow, low-impact approach to planting and maintaining a flower garden, a vegetable garden, trees, and shrubs naturally. Say good-bye to backaches and week problems.