๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimal interval completion through graph exploration

โœ Scribed by Karol Suchan; Ioan Todinca

Book ID
108281494
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
917 KB
Volume
410
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Graph Searching and Interval Completion
Graph Searching and Interval Completion
โœ Fomin, Fedor V.; Golovach, Petr A. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 150 KB
Complete Multi-partite Cutsets in Minima
Complete Multi-partite Cutsets in Minimal Imperfect Graphs
โœ G. Cornuejols; B. Reed ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 316 KB

We show that a minimal imperfect graph \(G\) cannot contain a cutset \(C\) which induces a complete multi-partite graph unless \(C\) is a stable set and \(G\) is an odd hole. This generalizes a result of Tucker, who proved that the only minimal imperfect graphs containing stable cutsets are the odd