✦ LIBER ✦

The Complexity of Infinite H-Coloring

✍ Scribed by B. Bauslaugh

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of nonrepetitive coloring

✍ Dániel Marx; Marcus Schaefer 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 549 KB

The complexity of minimum convex colorin

✍ Frank Kammer; Torsten Tholey 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 796 KB

The Complexity of Choosing an H -Colorin

✍ Goldberg, Leslie Ann; Kelk, Steven; Paterson, Mike 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 216 KB

On the complexity of the general colorin

✍ H.A. Maurer; J.H. Sudborough; E. Welzl 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 664 KB

Exploring the complexity boundary betwee

✍ Flavia Bonomo; Guillermo Durán; Javier Marenco 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 373 KB

Coloring infinite graphs and the Boolean

✍ H. Läuchli 📂 Article 📅 1971 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 326 KB