Displaying similar documents to “Decompositions of multigraphs into parts with the same size”

Decompositions of multigraphs into parts with two edges

Jaroslav Ivančo, Mariusz Meszka, Zdzisław Skupień (2002)

Discussiones Mathematicae Graph Theory

Similarity:

Given a family 𝓕 of multigraphs without isolated vertices, a multigraph M is called 𝓕-decomposable if M is an edge disjoint union of multigraphs each of which is isomorphic to a member of 𝓕. We present necessary and sufficient conditions for the existence of such decompositions if 𝓕 comprises two multigraphs from the set consisting of a 2-cycle, a 2-matching and a path with two edges.

Edge-domatic numbers of cacti

Bohdan Zelinka (1991)

Mathematica Bohemica

Similarity:

The edge-domatic number of a graph is the maximum number of classes of a partition of its edge set into dominating sets. This number is studied for cacti, i.e. graphs in which each edge belongs to at most one circuit.

Hypergraphs with large transversal number and with edge sizes at least four

Michael Henning, Christian Löwenstein (2012)

Open Mathematics

Similarity:

Let H be a hypergraph on n vertices and m edges with all edges of size at least four. The transversal number τ(H) of H is the minimum number of vertices that intersect every edge. Lai and Chang [An upper bound for the transversal numbers of 4-uniform hypergraphs, J. Combin. Theory Ser. B, 1990, 50(1), 129–133] proved that τ(H) ≤ 2(n+m)/9, while Chvátal and McDiarmid [Small transversals in hypergraphs, Combinatorica, 1992, 12(1), 19–26] proved that τ(H) ≤ (n + 2m)/6. In this paper, we...

Regulated buildups of 3-configurations

Václav J. Havel (1994)

Archivum Mathematicum

Similarity:

We deal with two types of buildups of 3-configurations: a generating buildup over a given edge set and a regulated one (according to maximal relative degrees of vertices over a penetrable set of vertices). Then we take account to minimal generating edge sets, i.e., to edge bases. We also deduce the fundamental relation between the numbers of all vertices, of all edges from edge basis and of all terminal elements. The topic is parallel to a certain part of Belousov' “Configurations...