✦ LIBER ✦

The complexity of colouring problems on dense graphs

✍ Scribed by Keith Edwards

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of -colouring planar g

✍ G. MacGillivray; M. Siggers 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 924 KB

The complexity of some graph colouring p

✍ Keith Edwards 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 896 KB

The complexity of H-colouring of bounded

✍ Anna Galluccio; Pavol Hell; Jaroslav Nešetřil 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 104 KB

On a graph colouring problem

✍ Maurice Cochand; Gyula Károlyi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Note on the colouring of graphs

✍ G. A. Dirac 📂 Article 📅 1951 🏛 Springer-Verlag 🌐 French ⚖ 400 KB

On the Parallel Complexity of Hamiltonia

✍ E. Dahlhaus; P. Hajnal; M. Karpinski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 729 KB