✦ LIBER ✦

Grid drawings of k-colourable graphs

✍ Scribed by David R. Wood

Book ID: 108100929
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 170 KB
Volume: 30
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.06.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ON UNIQUELY -G k-COLOURABLE GRAPHS

✍ Brown, J. I.; Corneil, D. G. 📂 Article 📅 1992 🏛 Taylor and Francis Group 🌐 English ⚖ 445 KB

Grid Drawings of 4-Connected Plane Graph

Grid Drawings of 4-Connected Plane Graphs

✍ K. Miura; S. Nakano; T. Nishizeki 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 322 KB

Uniquely (m, k)τ-colourable graphs and k

Uniquely (m, k)τ-colourable graphs and k − τ-saturated graphs

✍ Gerhard Benadé; Izak Broere; Betsie Jonck; Marietjie Frick 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 518 KB

For a graph G, the path number r(G) is defined as the order of a longest path in G. An (m, k)~-colouring of a graph H is a partition of the vertex set of H into m subsets such that each subset induces a subgraph of H for which r is at most k. The k -z-chromatic number z~(H) is the least m for which

Upward Three-Dimensional Grid Drawings o

Upward Three-Dimensional Grid Drawings of Graphs

✍ Vida Dujmović; David R. Wood 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 579 KB

Drawing graphs on rectangular grids

✍ Markus Schäffter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 889 KB

On the order of uniquely (k,m)-colourabl

On the order of uniquely (k,m)-colourable graphs

✍ Izak Broere; Marietjie Frick 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 578 KB