✦ LIBER ✦

Integer and Fractional Packings in Dense Graphs

✍ Scribed by P. E. Haxell; V. Rödl

Book ID: 106167917
Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 373 KB
Volume: 21
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930170003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asymptotically optimal -packings of dens

Asymptotically optimal -packings of dense graphs via fractional -decompositions

✍ Raphael Yuster 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Integer and fractional packings of hyper

Integer and fractional packings of hypergraphs

✍ V. Rödl; M. Schacht; M.H. Siggers; N. Tokushige 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Integer and fractional security in graph

Integer and fractional security in graphs

✍ Garth Isaak; Peter Johnson; Caleb Petrie 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Packing and covering dense graphs

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

Cycle packings in graphs and digraphs

✍ Jennifer J. Quinn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 196 KB

A cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) elementary cycles. If D is a demiregular multidigraph we show that the arcs of D can be partitioned into Ai. cycle packings --where Ain is the maximum indegree of a vertex in D. We then show that the maximum len

Brambles and independent packings in cho

Brambles and independent packings in chordal graphs

✍ Kathie Cameron 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 320 KB