✦ LIBER ✦

Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs

✍ Scribed by Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi

Book ID: 108498426
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 805 KB
Volume: 78
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)81016-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with unique minimum edge dominati

Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices

✍ Jerzy Topp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s

Average distances in undirected graphs a

Average distances in undirected graphs and the removal of vertices

✍ Ingo Althöfer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Disjoint cliques and disjoint maximal in

Disjoint cliques and disjoint maximal independent sets of vertices in graphs

✍ Paul Erdös; Arthur M. Hobbs; C. Payan 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 548 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

Contractible Edges in a 4-Connected Grap

Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four

✍ Kiyoshi Ando; Yoshimi Egawa 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 191 KB

Structure of neighborhoods of edges in p

Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces

✍ O. V. Borodin 📂 Article 📅 1993 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 667 KB