✦ LIBER ✦

Chordal intersection graphs of bands

✍ Scribed by Bedřich Pondělíček

Book ID: 110419574
Publisher: Springer
Year: 1999
Tongue: English
Weight: 354 KB
Volume: 49
Category: Article
ISSN: 0011-4642
DOI: 10.1023/a:1022407932228

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The intersection graphs of subtrees in t

The intersection graphs of subtrees in trees are exactly the chordal graphs

✍ Fǎnicǎ Gavril 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 523 KB

Finding intersection models: From chorda

Finding intersection models: From chordal to Helly circular-arc graphs

✍ Liliana Alcón; Marisa Gutierrez 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Reduced clique graphs of chordal graphs

✍ Michel Habib; Juraj Stacho 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 644 KB

Centers of chordal graphs

✍ Gerard J. Chang 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 505 KB

Clique Graphs of Chordal and Path Graphs

✍ Szwarcfiter, Jayme L.; Bornstein, Claudson F. 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 739 KB

Chordal embeddings of planar graphs

✍ V. Bouchitté; F. Mazoit; I. Todinca 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Robertson and Seymour conjectured that the treewidth of a planar graph and the treewidth of its geometric dual di er by at most one. Lapoire solved the conjecture in the a rmative, using algebraic techniques. We give here a much shorter proof of this result.