𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitioning graph matching with constraints

✍ Scribed by Richard E. Blake

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
420 KB
Volume
27
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs with independent perfect matching
Graphs with independent perfect matchings
✍ Marcelo H. de Carvalho; ClΓ‘udio L. Lucchesi; U. S. R. Murty πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 241 KB

A graph with at least two vertices is matching covered if it is connected and each edge lies in some perfect matching. A matching covered graph G is extremal if the number of perfect matchings of G is equal to the dimension of the lattice spanned by the set of incidence

Balanced graphs with edge density constr
Balanced graphs with edge density constraints
✍ John Sheehan πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 400 KB

## Abstract Suppose that __G__ is a finite simple graph with |__V__(__G__)| = 2__n__ (__n__ β‰  3). a partition (__X,Y__) of __V__(__G__) is balanced if (i) |__X__| = |__Y__| = __n__, (ii) Ξ΄(__X__) β‰₯ 1, Ξ΄(__Y__) β‰₯ 1. Where Ξ΄(__X__) is the minimum degree of the induced subgraph γ€ˆX〉 with vertex set

Balanced graphs with minimum degree cons
Balanced graphs with minimum degree constraints
✍ John Sheehan πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 464 KB

Sheehan, J., Balanced graphs with minimum degree constraints, Discrete Mathematics 102 (1992) 307-314. Let G be a finite simple graph on n vertices with minimum degree 6 = 6(G) (n = 6 (mod 2)). Suppose that 0 < 6 c n -2, 06 i 4 [?Sl. A partition (x, Y) of V(G) is said to be an (i, a)-partition of G