✦ LIBER ✦

Graphs drawn with few crossings per edge

✍ Scribed by János Pach; Géza Tóth

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for Graphs Embeddable with Fe

✍ Alexander Grigoriev; Hans L. Bodlaender 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 194 KB

Colour-critical graphs with few edges

✍ A.V. Kostochka; M. Stiebitz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Geometric Graphs with Few Disjoint Edges

✍ G. Tóth; P. Valtr 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 138 KB

Drawing Colored Graphs with Constrained

✍ Emilio Di Giacomo; Giuseppe Liotta; Francesco Trotta 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 650 KB

Color-critical graphs and hypergraphs wi

✍ H.L. Abbott; D.R. Hare; B. Zhou 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 378 KB

We give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or shorter and with relatively few edges.

On the Maximum Number of Edges in Topolo

✍ Eyal Ackerman 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 579 KB