✦ LIBER ✦

Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph

✍ Scribed by Jáan Plesník

Book ID: 110302693
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 104 KB
Volume: 5
Category: Article
ISSN: 1382-6905
DOI: 10.1023/a:1011457225589

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Property About Minimum Edge- and Minim

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph

✍ Raffaele Mosca 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 134 KB

The minimum augmentation of any graph to

The minimum augmentation of any graph to a K-edge-connected graph

✍ Guo-Ray Cai; Yu-Geng Sun 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 883 KB

The Number of Vertices of Degree k in a

The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph

✍ M.C. Cai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Minimum augmentation of a tree to a K-ed

Minimum augmentation of a tree to a K-edge-connected graph

✍ Shuichi Ueno; Yoji Kajitani; Hajime Wada 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

The minimum number of triangles covering

The minimum number of triangles covering the edges of a graph

✍ Jenö Lehel 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 703 KB

A remark on the number of vertices of de

A remark on the number of vertices of degree k in a minimally k-edge-connected graph

✍ Mao-cheng Cai 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Let G be a minimally k-edge-connected simple graph and u\*(G) be the number of vertices of degree k in G. proved that (i) uk(G) 2 l(jGl -1)/(2k + l)] + k + 1 for even k, and (ii) uI(G) 2 [lGl/(k + l)] + k for odd k 35 and u,(G) 2 lZlGl/(k + l)] + k -2 for odd k 27, where ICI denotes the number of v