𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity

✍ Scribed by Jun Fujisawa; Shinya Fujita; Michael D. Plummer; Akira Saito; Ingo Schiermeyer

Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
282 KB
Volume
31
Category
Article
ISSN
0209-9683

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

Forbidden subgraphs and hamiitonian prop
Forbidden subgraphs and hamiitonian properties in the square of a connected graph
✍ Ronald J. Gould; Michael S. Jacobson πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 331 KB πŸ‘ 1 views

Various Hamiltonian-like properties are investigated in the squares of connected graphs free of some set of forbidden subgraphs. The star K,+ the subdivision graph of &, and the subdivision graph of K1,3 minus an endvertex play central roles. In particular, we show that connected graphs free of the

Forbidden subgraphs and bounds on the si
Forbidden subgraphs and bounds on the size of a maximum matching
✍ Michael D. Plummer; Akira Saito πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 1 views

## Abstract Let __K__~1,__n__~ denote the star on __n__ + 1 vertices; that is, __K__~1,__n__~ is the complete bipartite graph having one vertex in the first vertex class of its bipartition and __n__ in the second. The special graph __K__~1,3~, called the __claw__, has received much attention in the

Subgraphs of large connectivity and chro
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number
✍ N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 144 KB

For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.

Combinatorics of perfect matchings in pl
Combinatorics of perfect matchings in plane bipartite graphs and application to tilings
✍ J.C. Fournier πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 737 KB

Let G be a plane bipartite graph which admits a perfect matching and with distinguished faces called holes. Let MG denote the perfect matchings graph: its vertices are the perfect matchings of G, two of them being joined by an edge, if and only if they di er only on an alternating cycle bounding a f