𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recognizing Powers of Proper Interval, Split, and Chordal Graphs

✍ Scribed by Lau, Lap Chi; Corneil, Derek G.

Book ID
118198892
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
255 KB
Volume
18
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs whose powers are chordal and grap
Graphs whose powers are chordal and graphs whose powers are interval graphs
✍ Flotow, Carsten πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 3 views

The main theorem of this paper gives a forbidden induced subgraph condition on G that is sufficient for chordality of G m . This theorem is a generalization of a theorem of Balakrishnan and Paulraja who had provided this only for m = 2. We also give a forbidden subgraph condition on G that is suffi

Coloring Powers of Chordal Graphs
Coloring Powers of Chordal Graphs
✍ KrΓ‘l', Daniel πŸ“‚ Article πŸ“… 2004 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 170 KB
LexBFS-orderings and powers of chordal g
LexBFS-orderings and powers of chordal graphs
✍ Andreas BrandstΓ€dt; Feodor F. Dragan; Falk Nicolai πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 824 KB

For an undirected graph G the kth power G k of G is the graph with the same vertex set as G where two vertices are adjacent iff their distance is at most k in G. In this paper we prove that any LexBFS-ordering of a chordal graph is a common perfect elimination ordering of all odd powers of this grap