✦ LIBER ✦

Every 2-choosable graph is (2m, m)-choosable

✍ Scribed by Tuza, Zs.; Voigt, M.

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 449 KB
Volume: 22
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199607)22:3<245::aid-jgt5>3.0.co;2-m

No coin nor oath required. For personal study only.

✦ Synopsis

A graph G = (V, E ) with vertex set V and edge set E is called (a, b)-choosable ( a 2 2b) if for any collection {L(w)lv E V} of sets L ( v ) of cardinality a there exists a collection

Giving a partial solution to a problem raised by Erdos, Rubin, and Taylor in 1979, we prove that every (2. 1)-choosable graph is (2m,m)-choosable for all m > 1. o 1996 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

Every Planar Graph Is 5-Choosable

✍ C. Thomassen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 56 KB

We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdös, A. L. Rubin, and H. Taylor. (i) 1994 Academic Press, Inc.

Every connected graph is a query graph

✍ Peter M. Winkler 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

Let Vbe a set of bit strings of length k, i.e., V C {0, l}'. The query graph Q ( V ) is defined as follows: the vertices of Q(V) are the elements of V, and {O,V} is an edge of Q ( V ) if and only if no other W E Vagrees with U in all the positions in which V does. If Vrepresents the set of keys for

Every (p, p-2) graph is contained in its

Every (p, p-2) graph is contained in its complement

✍ David Burns; Seymour Schuster 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 1 views

## Abstract The following is proved: If __G__ is graph of order __p__ (≥2) and size __p__‐2, then there exists an isomorphic embedding of __G__ into its complement.

Dialysis-related amyloid is amyloid of b

✍ Terence T. Casey; William J. Stone; Carol R. Diraimondo; David L. Page; Peter D. 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

On the diameter of the generalized undir

On the diameter of the generalized undirected de Bruijn graphs UGB(n,m), n2 m ≤ n3

✍ Jyhmin Kuo; Hung-Lin Fu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract The generalized de Bruijn digraph __G__~__B__~(__n__,__m__) is the digraph (__V__,__A__) where __V__ = {0, 1,…,__m__ − 1} and (__i__,__j__) ∈ __A__ if and only if __j__ ≡ __i____n__+__α__ (mod __m__) for some __α__ ∈ {0, 1, 2,…,__n__− 1}. By replacing each arc of __G__~__B__~(__n__,__m_

The 2μm plasmid of laboratory yeast stra

The 2μm plasmid of laboratory yeast strains is a type-1/type-2 hybrid

✍ Xiao, Wei; Rank, Gerald H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB

Industrial yeast strains carry one of two homeologous 2pm plasmids designated as type-I or type-2. The 2pm plasmid, Scpl, found in common laboratory strains of Sacrliiiroriijm~ cerevisiae is considered a type-2 plasmid. since the ori, STB, RAF and REPl loci and intergenic sequences of the right-uniq