𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pairs of forbidden induced subgraphs for homogeneously traceable graphs

✍ Scribed by Binlong Li; Hajo Broersma; Shenggui Zhang

Book ID
113567704
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
430 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Traceability in graphs with forbidden tr
Traceability in graphs with forbidden triples of subgraphs
✍ Ronald J. Gould; John M. Harris πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 724 KB

If 9 is a collection of connected graphs, and if a graph G does not contain any member of 9 as an induced subgraph, then G is said to be F-free. The members of f in this situation are called forbidden subgraphs. In a previous paper (Gould and Harris, 1995) the authors demonstrated two families of tr

Pancyclicity of 3-connected graphs: Pair
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
✍ Ronald J. Gould; Tomasz Łuczak; Florian Pfender πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 232 KB

## Abstract We characterize all pairs of connected graphs {__X__, __Y__} such that each 3‐connected {__X__, __Y__}‐free graph is pancyclic. In particular, we show that if each of the graphs in such a pair {__X__, __Y__} has at least four vertices, then one of them is the claw __K__~1,3~, while the