𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quickly Excluding K2,r from Planar Graphs

✍ Scribed by Dimitrios M. Thilikos

Book ID
104444477
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
106 KB
Volume
3
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Quickly Excluding a Planar Graph
Quickly Excluding a Planar Graph
✍ N. Robertson; P. Seymour; R. Thomas πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 1014 KB
Planar k-cycle resonant graphs with k=1,
Planar k-cycle resonant graphs with k=1,2
✍ Xiaofeng Guo; Fuji Zhang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 200 KB

A connected graph is said to be k-cycle resonant if, for 1 6 t 6 k, any t disjoint cycles in G are mutually resonant, that is, there is a perfect matching M of G such that each of the t cycles is an M -alternating cycle. The concept of k-cycle resonant graphs was introduced by the present authors in

On 2-factorizations of the complete grap
On 2-factorizations of the complete graph: From the k-pyramidal to the universal property
✍ Simona Bonvicini; Giuseppe Mazzuoccolo; Gloria Rinaldi πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 180 KB πŸ‘ 1 views

## Abstract We consider 2‐factorizations of complete graphs that possess an automorphism group fixing __k__β©Ύ0 vertices and acting sharply transitively on the others. We study the structures of such factorizations and consider the cases in which the group is either abelian or dihedral in some more d