Publication:3270978
From MaRDI portal
zbMath0094.36105MaRDI QIDQ3270978
Publication date: 1959
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, On odd circuits in chromatic graphs, On Minimal Blocks, A min-max relation for stable sets in graphs with no odd-\(K_ 4\), A matroid generalization of theorems of Lewin and Gallai, Gallai theorems for graphs, hypergraphs, and set systems, The strong metric dimension of graphs and digraphs, Matchings in simplicial complexes, circuits and toric varieties, On strong (weak) independent sets and vertex coverings of a graph, Disjoint paths in a rectilinear grid, A note on total domination, Equivalence between the minimum covering problem and the maximum matching problem, Maximum matchings in a class of random graphs, Fractional matchings and the Edmonds-Gallai theorem, A survey of the theory of hypercube graphs, A decomposition strategy for the vertex cover problem, The cochromatic index of a graph, Packing and covering with matroid circuits, On Petersen's graph theorem, On generalised minimal domination parameters for paths, Covering all cliques of a graph, Extensions of Gallai's graph covering theorems for uniform hypergraphs, Minimum spectral radius of a weighted graph, On total covering and matching of graphs, On complementary graphs with no isolated vertices, A constructive characterization of trees with at least k disjoint maximum matchings, Note on a matroid with parity condition, On the algorithmic complexity of twelve covering and independence parameters of graphs, On graphs with equal domination and covering numbers, Gallai-type theorems and domination parameters, On weakly connected domination in graphs, Using maximality and minimality conditions to construct inequality chains, Relations between the lower domination parameters and the chromatic number of a graph., Interpolation theorems for graphs, hypergraphs and matroids, Characterization of graphs with equal domination and covering number, Generalized independence and domination in graphs, Tibor Gallai, Tibor Gallai - seventy years old, Covers in hypergraphs, The chromatic number and other functions of the lexicographic product, On the asymptotic behavior of the independence number of a random \((n,n)\)-tree, Covering and independence in triangle structures, Quasi-threshold graphs, Subgroup coverings of some sporadic groups., Some bounds on the \(p\)-domination number in trees, On the point-core of a graph, Hereditary properties of raphs, A note on line coverings of graphs, Colour-critical graphs and hypergraphs, On an interpolation property of outerplanar graphs, 2-Matchings and 2-covers of hypergraphs
