✦ LIBER ✦

Edge crossings in drawings of bipartite graphs

✍ Scribed by Peter Eades; Nicholas C. Wormald

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edges without crossings in drawings of c

✍ Heiko Harborth; Ingrid Mengersen 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 595 KB

Generalized Thrackle Drawings of Non-bip

✍ Grant Cairns; Yury Nikolayevsky 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 400 KB

Approximation Algorithms for Minimizing

✍ Seok-Hee Hong; Hiroshi Nagamochi 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 708 KB

Coloring drawings of bipartite graphs: A

✍ F.W. Sinden 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Covering the edges of bipartite graphs u

✍ Dorit S. Hochbaum; Asaf Levin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 570 KB

Local edge-connectivity in regular bipar

✍ Yahya Ould Hamidoune; Michel Las Vergnas 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 109 KB