✦ LIBER ✦

Graph dismantling problems

✍ Scribed by A. M. Dawes; J. B. Florence

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 526 KB
Volume: 7
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190070306

No coin nor oath required. For personal study only.

✦ Synopsis

Problems involving the dismantling of a digraph (graph) by removal of arcs (edges) are investigated. Some of these problems have good characterizations related to the familiar results about Euler trails, others are NP-complete.

📜 SIMILAR VOLUMES

Gibbs Measures and Dismantlable Graphs

✍ Graham R. Brightwell; Peter Winkler 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 272 KB

We model physical systems with ``hard constraints'' by the space Hom(G, H) of homomorphisms from a locally finite graph G to a fixed finite constraint graph H. Two homomorphisms are deemed to be adjacent if they differ on a single site of G. We investigate what appears to be a fundamental dichotomy

A Helly theorem for geodesic convexity i

A Helly theorem for geodesic convexity in strongly dismantlable graphs

✍ Norbert Polat 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 476 KB

A (finite or infinite) graph G is strongly dismantlable if its vertices can be linearly ordered x o ..... x~ so that, for each ordinal fl < ~, there exists a strictly increasing finite sequence (i~)0~<j~<n of ordinals such that i o = fl, i, = ct and xi~ +1 is adjacent with x~j and with all neighbors

Extremal problems in graph theory

✍ Béla Bollobás 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract The aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.

Heuristics for Semirandom Graph Problems

✍ Uriel Feige; Joe Kilian 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 243 KB

We consider semirandom graph models for finding large independent sets, colorings, and bisections in graphs. These models generate problem instances by blending random and adversarial decisions. To generate semirandom independent set problems, an independent set S of an vertices is randomly chosen.

Complexity of graph embeddability proble

Complexity of graph embeddability problems

✍ C. Benzaken; S. Foldes 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 890 KB

Dismantling the immune system

✍ Peter Mombaerts 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 960 KB