✦ LIBER ✦

Generalized Thrackle Drawings of Non-bipartite Graphs

✍ Scribed by Grant Cairns; Yury Nikolayevsky

Book ID: 106149873
Publisher: Springer
Year: 2008
Tongue: English
Weight: 400 KB
Volume: 41
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-008-9095-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge crossings in drawings of bipartite

Edge crossings in drawings of bipartite graphs

✍ Peter Eades; Nicholas C. Wormald 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 1020 KB

Coloring drawings of bipartite graphs: A

Coloring drawings of bipartite graphs: A problem in automated assembly

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

A generalized construction of chromatic

A generalized construction of chromatic index critical graphs from bipartite graphs

✍ Michael Plantholt 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB

W e prove that any graph with maximum degree n which can be obtained by removing exactly 2n -1 edges from the join K? -K, ,, is n-critical This generalizes special constructions of critical graphs by S Fiorini and H P Yap, and suggests a possible extension of another general construction due to Yap

Extremal non-bipartite regular graphs of

Extremal non-bipartite regular graphs of girth 4

✍ Zhao Dong-fang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 95 KB

Extremal non-bipartite regular graphs of

Extremal non-bipartite regular graphs of girth 4

✍ Douglas Bauer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Optimal partition of a bipartite graph i

Optimal partition of a bipartite graph into non-crossing matchings

✍ Federico Malucelli; Sara Nicoloso 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 239 KB