✦ LIBER ✦

3-Colourability and Forbidden Subgraphs

✍ Scribed by Bert Randerath

Book ID: 104444561
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 319 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80183-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex Colouring and Forbidden Subgraphs

Vertex Colouring and Forbidden Subgraphs – A Survey

✍ Bert Randerath; Ingo Schiermeyer 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 641 KB

3-Colorability and forbidden subgraphs.

3-Colorability and forbidden subgraphs. I: Characterizing pairs

✍ Bert Randerath 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Forbidden subgraph decomposition

✍ Irena Rusu; Jeremy Spinrad 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 96 KB

Forbidden ordered subgraph vs. forbidden

Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes

✍ Ginn, Mark 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

We show that the minimum set of unordered graphs that must be forbidden to get the same graph class characterized by forbidding a single ordered graph is infinite.

Eigenvalues and forbidden subgraphs I

✍ Vladimir Nikiforov 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Forbidden subgraphs and graph decomposit

Forbidden subgraphs and graph decomposition

✍ Donald K. Wagner 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 324 KB