𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recognizing graphs without asteroidal triples

✍ Scribed by Ekkehard Köhler

Book ID
108167495
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
179 KB
Volume
2
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Induced matchings in asteroidal triple-f
Induced matchings in asteroidal triple-free graphs
✍ Jou-Ming Chang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 193 KB

An induced matching M of a graph G is a set of pairwise nonadjacent edges such that no two edges of M are joined by an edge in G. The problem of ÿnding a maximum induced matching is known to be NP-hard even for bipartite graphs of maximum degree four. In this paper, we study the maximum induced matc

Approximating the Bandwidth for Asteroid
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
✍ Ton Kloks; Dieter Kratsch; Haiko Müller 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 110 KB

We show that there is an O nm algorithm to approximate the bandwidth of an AT-free graph with worst case performance ratio 2. Alternatively, at the cost of the Ž . approximation factor, we can also obtain an O m q n log n algorithm to approximate the bandwidth of an AT-free graph within a factor 4.

Three-graphs without two triples whose s
Three-graphs without two triples whose symmetric difference is contained in a third
✍ Béla Bollobás 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Rcodwi I Mav l'b73\* . Abstr~t, #Liptona ctin~ez lured that if a three-graph has 3n vertices and ?I'+ 1 tr pks, then there are two triple% who% q mmctriit difference is contained in a third triple. This conjecture can be \*.rlnsidered a~ ik notural ..ener&.atrc~n of Turin's theorem 14) for edge gra