✦ LIBER ✦

Forbidden subgraphs generating a finite set

✍ Scribed by Fujisawa, Jun; Plummer, Michael D.; Saito, Akira

Book ID: 120515748
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 393 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.05.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On power graphs of finite groups with fo

On power graphs of finite groups with forbidden induced subgraphs

✍ Doostabadi, A.; Erfanian, A.; Farrokhi D.G., M. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Automated generation of conjectures on f

Automated generation of conjectures on forbidden subgraph characterization

✍ Desrosiers, Christian; Galinier, Philippe; Hansen, Pierre; Hertz, Alain 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 933 KB

“Bicoverings of a finite set” by generat

“Bicoverings of a finite set” by generating function methods

✍ James Reilly 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 343 KB

Vertex Colouring and Forbidden Subgraphs

Vertex Colouring and Forbidden Subgraphs – A Survey

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

Graph Classes: A Survey || 7. Forbidden

Graph Classes: A Survey || 7. Forbidden Subgraphs

✍ Brandstädt, Andreas; Le, Van Bang; Spinrad, Jeremy P. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics ⚖ 160 KB

A generalization of fan's condition and

A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity

✍ Zhiquan Hu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 591 KB

Let G be a 2-connected graph with n vertices and H be an induced subgraph of G. Denote 6 := {u E V(G): d(o) > n/2}. If there exists a pair of vertices x and y at distance 2 in H such that {x, y} c V(H)\K, then H is called degree light. Let F be the unique graph with degree sequence (1, 1,1,3,3,3). I