𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring Powers of Chordal Graphs

✍ Scribed by Král', Daniel

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring Powers of Planar Graphs
Coloring Powers of Planar Graphs
✍ Agnarsson, Geir; Halldórsson, Magnús M. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 183 KB
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

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

Perfect elimination orderings of chordal
Perfect elimination orderings of chordal powers of graphs
✍ Andreas Brandstädt; Victor D. Chepoi; Feodor F. Dragan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Let G = (V,E) be a finite undirected connected graph. We show that there is a common perfect elimination ordering of all powers of G which represent chordal graphs. Consequently, if G and all of its powers are chordal then all these graphs admit a common perfect elimination ordering. Such an orderin