𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Untangling Polygons and Graphs

✍ Scribed by Josef Cibulka

Publisher
Springer
Year
2009
Tongue
English
Weight
381 KB
Volume
43
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Untangling a Polygon
Untangling a Polygon
✍ Pach; Tardos πŸ“‚ Article πŸ“… 2002 πŸ› Springer 🌐 English βš– 75 KB
Untangling a Planar Graph
Untangling a Planar Graph
✍ Xavier Goaoc; Jan KratochvΓ­l; Yoshio Okamoto; Chan-Su Shin; Andreas Spillner; Al πŸ“‚ Article πŸ“… 2009 πŸ› Springer 🌐 English βš– 829 KB
Homogeneous Graphs and Regular Near Poly
Homogeneous Graphs and Regular Near Polygons
✍ K. Nomura πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 210 KB

We consider a distance-regular graph having homogeneous edge patterns in each entry of its intersection diagram with respect to an edge. We call such graphs homogeneous graphs. We study elementary properties of homogeneous graphs, and we show these graphs are related deeply with regular near polygon

Polygon Graph Recognition
Polygon Graph Recognition
✍ E.S. Elmallah; L.K. Stewart πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 335 KB

For any fixed integer k G 2, define the class of k-polygon graphs as the intersection graphs of chords inside a convex k-polygon, where the endpoints of each chord lie on two different sides. The case where k s 2 is degenerate; for our purpose, we view any pair of parallel lines as a 2-polygon. Henc

Covering and coloring polygon-circle gra
Covering and coloring polygon-circle graphs
✍ Alexandr Kostochka; Jan KratochvΓ­l πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 348 KB

Polygon-circle graphs are intersection graphs of polygons inscribed in a circle. This class of graphs includes circle graphs (intersection graphs of chords of a circle), circular arc graphs (intersection graphs of arcs on a circle), chordal graphs and outerplanar graphs. We investigate binding funct