✦ LIBER ✦

Covering and packing for pairs

✍ Scribed by Chee, Yeow Meng; Colbourn, Charles J.; Ling, Alan C.H.; Wilson, Richard M.

Book ID: 120297012
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 212 KB
Volume: 120
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2013.04.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing and covering tetrahedra

✍ Ghosh, S.K.; Haxell, P.E. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Long packing and covering codes

✍ Cohen, G.; Honkala, I.; Litsyn, S.; Sole, P. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 175 KB

Majorization, packing, covering and matr

Majorization, packing, covering and matroids

✍ Zbigniew Lonc 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Extremal packing and covering sets

✍ Rajinder Jeet Hans 📂 Article 📅 1967 🏛 Springer Vienna 🌐 English ⚖ 440 KB

Packing and covering dense graphs

✍ Noga Alon; Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 1 views

Constructive characterizations for packi

Constructive characterizations for packing and covering with trees

✍ András Frank; László Szegő 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 342 KB

We give a constructive characterization of undirected graphs which contain k spanning trees after adding any new edge. This is a generalization of a theorem of Henneberg and Laman who gave the characterization for k = 2. We also give a constructive characterization of graphs which have k edge-disjoi