𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Graph Classes: A Survey || 7. Forbidden
✍ 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
✍ 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