๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Packings by cliques and by finite families of graphs

โœ Scribed by P Hell; D.G Kirkpatrick

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
760 KB
Volume
49
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Vo., -"--4v V2 Vn 1 Vn ~.k*l~ Vrmk Lemma 1. A {/(2, K3}-packing O of a graph H is of maximum size if and only if it admits no augmenting path, tail, or kite (a, b, or c).

๐Ÿ“œ SIMILAR VOLUMES

On the partition and coloring of a graph
On the partition and coloring of a graph by cliques
โœ W.D. Wallis; Guo-Hui Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 859 KB

Wallis, W.D. and G.-H. Zhang, On the partition and coloring of a graph by cliques, Discrete Mathematics 120 (1993) 191-203. We first introduce the concept of the k-chromatic index of a graph, and then discuss some of its properties. A characterization of the clique partition number of the graph G V

Matroidal families of finite connected n
Matroidal families of finite connected nonhomeomorphic graphs exist
โœ Thomas Andreae ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 197 KB

## Abstract A matroidal family is a nonempty set โ„ฑ of connected finite graphs such that for every arbitrary finite graph __G__ the edge sets of the subgraphs of __G__ which are isomorphic to an element of โ„ฑ form a matroid on the edge set of __G__. In the present paper the question whether there are

Families of arcs disconnected by finite
Families of arcs disconnected by finite sets I
โœ M. Rochowski ๐Ÿ“‚ Article ๐Ÿ“… 1975 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 140 KB

By M. ROCHOWSKI of Katowice (Eingegangen am 5 . 12. 1973) 1. Introduction. I n this paper a generalization (theorem C,) of theorem Ci proved in [3] shall be formulated and as a consequence of it we prove MENOER'S n-Beinsatz (see [l], [2], [4]). The proof of theorem C, shall be published separately i

General properties of some families of g
General properties of some families of graphs defined by systems of equations
โœ Felix Lazebnik; Andrew J. Woldar ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 200 KB

## Abstract In this paper we present a simple method for constructing infinite families of graphs defined by a class of systems of equations over commutative rings. We show that the graphs in all such families possess some general properties including regularity and biregularity, existence of speci

Graphs of Finite Mass Which Cannot Be Ap
Graphs of Finite Mass Which Cannot Be Approximated by Smooth Graphs with Equibounded Area
โœ Domenico Mucci ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 369 KB

We show that there exist graphs of Cartesian maps, of finite mass, which cannot be approximated weakly as currents by graphs of smooth maps with equibounded area. ## 1998 Academic Press This paper deals with the relaxed extension of the nonparametric area functional for vector valued maps. Let 0