✦ LIBER ✦

A characterization of graphical covers

✍ Scribed by A.R. Bednarek; R.E. Osteen

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 226 KB
Volume: 57
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90164-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Tutt's Characterization of graphic ma

On Tutt's Characterization of graphic matroids—a graphic proof

✍ A. M. H. Gerards 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

## Abstract In this paper we present a relatively simple proof of Tutt's characterization of graphic matroids. The proof uses the notion of ‘signed graph’ and it is ‘graphic’ in the sense that it can be presented almost entirely by drawing (signed) graphs. © 1995 John Wiley & Sons, Inc.

A characterization of exactly covering c

A characterization of exactly covering congruences

✍ Aviezri S. Fraenkel 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 454 KB

If every nonnegative integer occurs in exactly one of the integer sequences QiU+$, It = 0, 1,2, . . . . 0 < 41 (... Lam, 0 5 bi < aj, i = 1, . . . . m, then the system ain + bi is called an exactly covering system (ECS). Our main result is that ain f bi is an ECS if and only if I%! \_ ape1 B,(bi/ai)

A graphical characterization of the effi

A graphical characterization of the efficient set for

✍ Francisco Ruiz; Lourdes Rey; María del Mar Muñoz 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 432 KB

A simple characterization of disjoint co

A simple characterization of disjoint covering systems

✍ Štefan Znám 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 288 KB

a system of arithmetic sequences to ith 0 G a < ?I. y a(n) dGnote the set of all where s is an teger. A system . If(f)isa S, then putting z = -1 in (3) we get ~ll~~xP[~~l -'. 1) + eee + ~xp[~~]/(exp[~~] -11) = l/(e -1). ow the opp,osi te is sbvious. in [2] that (1) is

Chordal characterization of graphic matr

Chordal characterization of graphic matroids

✍ Wiktor Piotrowski 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 722 KB

In this paper we present the characterization of graphic matroids using the concept of a chord. Then we apply this characterization to solve a problem of Szamkolowicz [9]. One of the deepest theorems in the theory of matroids is Tuttes excludedminor characterization of graphic matroids [ 111. The p

Characterization of the σ-cover of a com

Characterization of the σ-cover of a compact

✍ V. K. Zaharov; A. V. Koldunov 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 657 KB

By Y. K. ZAHAROY and A. 1'. K o r . ~r x o r of Leningrad (R,eceired March 27. 1981) In [ i ] and [2] the notion of u-cover of a compact space was introduced. A compact space a> is called a u -c o w of c( coinpnct spcrce S iff it is the smallest basically disconnected ( = a-extremally disconnected)