𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bin-packing and matchings in threshold graphs

✍ Scribed by G. Tinhofer

Book ID
104183096
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
538 KB
Volume
62
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Matchings and walks in graphs
Matchings and walks in graphs
✍ C. D. Godsil πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 527 KB

## Abstract The matching polynomial Ξ±(__G, x__) of a graph __G__ is a form of the generating function for the number of sets of __k__ independent edges of __G__. in this paper we show that if __G__ is a graph with vertex __v__ then there is a tree __T__ with vertex __w__ such that \documentclass{ar

Matchings in polytopal graphs
Matchings in polytopal graphs
✍ B. GrΓΌnbaum πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 667 KB
Matchings and matching extensions in gra
Matchings and matching extensions in graphs
✍ Ciping Chen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 360 KB

Let G be a graph with a perfect matching and k be an integer such that l~<k< I V(G)l/2. Then G is said to be k-extendable if every matching of size k in G extends to a perfect matching of G. Plummer (1994) proved that every (2k + 1)-connected K~,s-free graph of even order is k-extendable. In this p

Induced matchings in cubic graphs
Induced matchings in cubic graphs
✍ Peter HorΓ‘k; He Qing; William T. Trotter πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 527 KB

## Abstract In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by ErdΓΆs and NeΕ‘etΕ™il: For each __d__ β‰₯ 3, the edge set of a graph of maximum de