scientific article
From MaRDI portal
Publication:3270978
zbMath0094.36105MaRDI QIDQ3270978
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On odd circuits in chromatic graphs, Classification of trees by Laplacian eigenvalue distribution and edge covering number, Establishing herd immunity is hard even in simple geometric networks, A Gallai’s Theorem type result for the edge stability of graphs, Geodesic packing in graphs, On the transversal number of rank \(k\) hypergraphs, Some new results on Gallai theorem and perfect matching for \(k\)-uniform hypergraphs, An improvement on Łuczak's connected matchings method, Bounds on piercing and line-piercing numbers in families of convex sets in the plane, Stability, vertex stability, and unfrozenness for special graph classes, Efficiently recognizing graphs with equal independence and annihilation numbers, The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs, THE GLOBAL EQUITABLE DOMINATION IN GRAPHS, On the vertex stability numbers of graphs, On Minimal Blocks, Strong vb-dominating and vb-independent sets of a graph, Unnamed Item, Approximation algorithms in combinatorial scientific computing, My Top 10 Graph Theory Conjectures and Open Problems, On the edge geodetic and edge geodetic domination numbers of a graph, On graphs with equal domination and covering numbers, On generalized Sierpiński graphs, Maximum matchings in a class of random graphs, Outer independent Roman dominating functions in graphs, Fractional matchings and the Edmonds-Gallai theorem, A parameterized perspective on packing paths of length two, Gallai-type theorems and domination parameters, On weakly connected domination in graphs, A survey of the theory of hypercube graphs, On the perfect differential of a graph, On the asymptotic behavior of the independence number of a random \((n,n)\)-tree, 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, On the outer independent double Roman domination number, Covering and independence in triangle structures, Using maximality and minimality conditions to construct inequality chains, Unnamed Item, A decomposition strategy for the vertex cover problem, The price of defense, Quasi-threshold graphs, Edge-covers in \(d\)-interval hypergraphs, Domination parameters with number 2: interrelations and algorithmic consequences, On vertex independence number of uniform hypergraphs, On the strong metric dimension of Cartesian and direct products of graphs, The total co-independent domination number of some graph operations, On the super domination number of lexicographic product graphs, Unnamed Item, On edge product cordial graphs, Fair division with multiple pieces, The cochromatic index of a graph, Strong resolving graphs: the realization and the characterization problems, Packing and covering with matroid circuits, On Petersen's graph theorem, Improper C-colorings of graphs, Directed domination in oriented graphs, On the distribution of Laplacian eigenvalues of a graph, Relations between the lower domination parameters and the chromatic number of a graph., A constructive characterization of vertex cover Roman trees, Forbidden subgraphs and the König-Egerváry property, On \(k\)-domination and \(j\)-independence in graphs, On generalised minimal domination parameters for paths, Covering all cliques of a graph, Extensions of Gallai's graph covering theorems for uniform hypergraphs, A superlocal version of Reed's conjecture, Unnamed Item, Equitable partitions into matchings and coverings in mixed graphs, Minimum spectral radius of a weighted graph, From the strong differential to Italian domination in graphs, 2-Matchings and 2-covers of hypergraphs, On matching numbers of tree and bipartite degree sequences, On the strong metric dimension of the strong products of graphs, Complexity and approximation of the constrained forest problem, On families of categorial grammars of bounded value, their learnability and related complexity questions, Subgroup coverings of some sporadic groups., Some bounds on the \(p\)-domination number in trees, A min-max relation for stable sets in graphs with no odd-\(K_ 4\), Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs, A note on double domination in graphs, On total covering and matching of graphs, Metabolic networks are NP-hard to reconstruct, On complementary graphs with no isolated vertices, Graphs with equal domination and covering numbers, Unnamed Item, A constructive characterization of trees with at least k disjoint maximum matchings, On the point-core of a graph, Note on a matroid with parity condition, The Private Neighbor Concept, Domination in Digraphs, Models of Domination in Graphs, Tibor Gallai, Vertex and edge covers with clustering properties: Complexity and algorithms, New bounds on the double total domination number of graphs, Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ, Outer independent rainbow dominating functions in graphs, On the algorithmic complexity of twelve covering and independence parameters of graphs, On the global strong resilience of fault Hamiltonian graphs, Hereditary properties of raphs, Forbidden subgraphs and the Kőnig property, A note on line coverings of graphs, Colour-critical graphs and hypergraphs, Tibor Gallai - seventy years old, Covers in hypergraphs, Interpolation theorems for graphs, hypergraphs and matroids, Characterization of graphs with equal domination and covering number, Generalized independence and domination in graphs, The chromatic number and other functions of the lexicographic product, Remarks on the outer-independent double Italian domination number, Disjoint paths in a rectilinear grid, Locating-dominating sets: from graphs to oriented graphs, Outer independent global dominating set of trees and unicyclic graphs, The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph, A note on total domination and 2-rainbow domination in graphs, A matroid generalization of theorems of Lewin and Gallai, On an interpolation property of outerplanar graphs, Gallai theorems for graphs, hypergraphs, and set systems, A note on total domination, Equivalence between the minimum covering problem and the maximum matching problem, Double outer-independent domination number of graphs, A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
