𝔖 Bobbio Scriptorium
✦   LIBER   ✦

3-Colorability and forbidden subgraphs. I: Characterizing pairs

✍ Scribed by Bert Randerath

Book ID
108315937
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
351 KB
Volume
276
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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

A pair of forbidden subgraphs and perfec
A pair of forbidden subgraphs and perfect matchings
✍ Shinya Fujita; Ken-ichi Kawarabayashi; Claudio Leonardo Lucchesi; Katsuhiro Ota; πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 169 KB