𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertices Belonging to All Critical Sets of a Graph

✍ Scribed by Levit, Vadim E.; Mandrescu, Eugen

Book ID
118197939
Publisher
Society for Industrial and Applied Mathematics
Year
2012
Tongue
English
Weight
135 KB
Volume
26
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Almost All 3-Connected Graphs Contain a
Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 223 KB

McCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a connected subgraph H on k vertices such that G&V(H) is 2-connected. We prove the weaker statement that every sufficiently large 3-connected graph G contains a not necessarily connected subgraph H on k vertices s

Vertices of degree 6 in a 6-contraction
Vertices of degree 6 in a 6-contraction critical graph
✍ Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 229 KB

An edge of a \(k\)-connected graph is said to be \(k\)-contractible if the contraction of the edge results in a \(k\)-connected graph. A \(k\)-connected graph with no \(k\)-contractible edge is said to be a \(k\)-contraction critical graph. We prove that every 6 -contraction critical graph of order

How to personalize the vertices of a gra
How to personalize the vertices of a graph?
✍ Kalinowski, RafaΕ‚; PilΕ›niak, Monika; PrzybyΕ‚o, Jakub; WoΕΊniak, Mariusz πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 372 KB