✦ LIBER ✦

Packing cycles through prescribed vertices under modularity constraints

✍ Scribed by Naonori Kakimura; Ken-ichi Kawarabayashi

Book ID: 119181017
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 288 KB
Volume: 49
Category: Article
ISSN: 0196-8858
DOI: 10.1016/j.aam.2012.03.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing cycles with modularity constrain

Packing cycles with modularity constraints

✍ Paul Wollan 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 397 KB

Packing Directed Circuits through Prescr

Packing Directed Circuits through Prescribed Vertices Bounded Fractionally

✍ Kakimura, Naonori; Kawarabayashi, Ken-ichi 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 307 KB

Cycles through prescribed vertices with

Cycles through prescribed vertices with large degree sum

✍ Katsuhiro Ota 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 366 KB

On cycles through prescribed vertices in

On cycles through prescribed vertices in weakly separable graphs

✍ A.K. Kelmans; M.V. Lomonosov 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Notions and notations 1.1. Given an undirected graph G let V(G), E(G), K(G) and comp(G) denote the vertex-set, edge-set, vertex connectivity and number of components of G, respectively. Put P(G)={(X, Y): X~V(G), Tc\\_E(G--X)}. For X~V(G) let G(X) denote the induced suL\\*graph. For Y :\\_ E(G) let G