𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph Searching on Some Subclasses of Chordal Graphs

✍ Scribed by S.-L. Peng; C. Y. Tang; M.-T. Ko; C.-W. Ho; T.-s. Hsu

Publisher
Springer
Year
2000
Tongue
English
Weight
244 KB
Volume
27
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On some subclasses of well-covered graph
On some subclasses of well-covered graphs
✍ Jo Ann W. Staples πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 367 KB πŸ‘ 1 views

A set of points in a graph is independent if no two points in the set are adjacent. A graph is well covered if every maximal independent set is a maximum independent set or, equivalently, if every independent set is contained in a maximum independent set. The well-covered graphs are classified by th

On b-perfect Chordal Graphs
On b-perfect Chordal Graphs
✍ FrΓ©dΓ©ric Maffray; Meriem Mechebbek πŸ“‚ Article πŸ“… 2009 πŸ› Springer Japan 🌐 English βš– 228 KB
Centers of chordal graphs
Centers of chordal graphs
✍ Gerard J. Chang πŸ“‚ Article πŸ“… 1991 πŸ› Springer Japan 🌐 English βš– 505 KB
On the chordality of a graph
On the chordality of a graph
✍ Terry A. McKee; Edward R. Scheinerman πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 574 KB

## Abstract The __chordality__ of a graph __G__ = (__V, E__) is defined as the minimum __k__ such that we can write __E__ = __E__~1~ ∩ … ∩ __E__~__k__~ with each (__V, E__~__i__~) a chordal graph. We present several results bounding the value of this generalization of boxicity. Our principal result