𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization of certain distance-regular graphs by forbidden subgraphs

✍ Scribed by V. V. Kabanov; A. A. Makhnev; D. V. Paduchikh

Book ID
111454372
Publisher
SP MAIK Nauka/Interperiodica
Year
2007
Tongue
English
Weight
159 KB
Volume
75
Category
Article
ISSN
1064-5624

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Characterizing path graphs by forbidden
Characterizing path graphs by forbidden induced subgraphs
✍ Benjamin LΓ©vΓͺque; FrΓ©dΓ©ric Maffray; Myriam Preissmann πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

## Abstract A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. Β© 2009

Graph classes characterized both by forb
Graph classes characterized both by forbidden subgraphs and degree sequences
✍ Michael D. Barrus; Mohit Kumbhat; Stephen G. Hartke πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 198 KB

## Abstract Given a set ${\cal F}$ of graphs, a graph __G__ is ${\cal F}$‐free if __G__ does not contain any member of ${\cal F}$ as an induced subgraph. We say that ${\cal F}$ is a degree‐sequence‐forcing set if, for each graph __G__ in the class ${\cal C}$ of ${\cal F}$‐free graphs, every realiza