✦ LIBER ✦

Drawing graphs with right angle crossings

✍ Scribed by Walter Didimo; Peter Eades; Giuseppe Liotta

Book ID: 113927415
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 342 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.05.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs that admit right angle crossing d

Graphs that admit right angle crossing drawings

✍ Karin Arikushi; Radoslav Fulek; Balázs Keszegh; Filip Morić; Csaba D. Tóth 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 221 KB

EVERY OUTER-1-PLANE GRAPH HAS A RIGHT AN

EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING

✍ DEHKORDI, HOOMAN REISI; EADES, PETER 📂 Article 📅 2012 🏛 World Scientific Publishing Company 🌐 English ⚖ 533 KB

Graphs That Admit Polyline Drawings with

Graphs That Admit Polyline Drawings with Few Crossing Angles

✍ Ackerman, Eyal; Fulek, Radoslav; Tóth, Csaba D. 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 383 KB

Right angle crossing graphs and 1-planar

Right angle crossing graphs and 1-planarity

✍ Eades, Peter; Liotta, Giuseppe 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Drawings of graphs on surfaces with few

Drawings of graphs on surfaces with few crossings

✍ F. Shahrokhi, L. A. Székely, O. Sýkora and I. Vrt'o 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 305 KB

Coloring plane graphs with independent c

Coloring plane graphs with independent crossings

✍ Daniel Král'; Ladislav Stacho 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

## Abstract We show that every plane graph with maximum face size four in which all faces of size four are vertex‐disjoint is cyclically 5‐colorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are 5‐colorable. © 2009 Wiley Periodicals, Inc.