✦ LIBER ✦

On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs

✍ Scribed by M. C. Golumbic, B. Ries

Book ID: 120788684
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 347 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1133-7

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

Characterizing and computing the structu

Characterizing and computing the structure of clique intersections in strongly chordal graphs

✍ Nevries, Ragnar; Rosenke, Christian 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 538 KB

Intersection graphs of curves in the pla

Intersection graphs of curves in the plane

✍ G Ehrlich; S Even; R.E Tarjan 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 629 KB

On Characterizations of Rigid Graphs in

On Characterizations of Rigid Graphs in the Plane Using Spanning Trees

✍ Sergey Bereg 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 145 KB

The parity path problem on some subclass

The parity path problem on some subclasses of perfect graphs

✍ C.R. Satyan; C.Pandu Rangan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 560 KB

Reconstructing sets of orthogonal line s

Reconstructing sets of orthogonal line segments in the plane

✍ Franz Rendl; Gerhard Woeginger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 550 KB

Rend], F. and G. Woeginger, Reconstructing sets of orthogonal line segments in the plane, Discrete Mathematics 119 (1993) 1677174. We show that reconstructing a set of n orthogonal line segments in the plane from the set of their vertices can be done in O(n log n) time, if the segments are allowed