Displaying similar documents to “Ehrhart clutters: regularity and max-flow min-cut.”

On a generalization of perfect b -matching

Ľubica Šándorová, Marián Trenkler (1991)

Mathematica Bohemica

Similarity:

The paper is concerned with the existence of non-negative or positive solutions to A f = β , where A is the vertex-edge incidence matrix of an undirected graph. The paper gives necessary and sufficient conditions for the existence of such a solution.

Choice-Perfect Graphs

Zsolt Tuza (2013)

Discussiones Mathematicae Graph Theory

Similarity:

Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E. If such a ϕ exists, G is said to be list colorable. The choice number of G is the smallest natural number k for which G is list colorable whenever each list contains at least k colors. In this note we initiate the study of graphs in which the choice...

On the connectivity of the annihilating-ideal graphs

T. Tamizh Chelvam, K. Selvakumar (2015)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Let R be a commutative ring with identity and 𝔸*(R) the set of non-zero ideals with non-zero annihilators. The annihilating-ideal graph of R is defined as the graph 𝔸𝔾(R) with the vertex set 𝔸*(R) and two distinct vertices I₁ and I₂ are adjacent if and only if I₁I₂ = (0). In this paper, we examine the presence of cut vertices and cut sets in the annihilating-ideal graph of a commutative Artinian ring and provide a partial classification of the rings in which they appear. Using this,...