scientific article; zbMATH DE number 3154393

Cited in

(only showing first 100 items - show all)

Vertex and edge covers with clustering properties: Complexity and algorithms
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
Domination parameters with number 2: interrelations and algorithmic consequences
Strong resolving graphs: the realization and the characterization problems
Metabolic networks are NP-hard to reconstruct
Tibor Gallai - seventy years old
Tibor Gallai
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
On matching numbers of tree and bipartite degree sequences
Disproofs of two conjectures on no hole anti-n-labeling of graphs
A note on double domination in graphs
New bounds on the double total domination number of graphs
On the global strong resilience of fault Hamiltonian graphs
Locating-dominating sets: from graphs to oriented graphs
A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size
On the outer independent double Roman domination number
Fair division with multiple pieces
A constructive characterization of vertex cover Roman trees
Equitable partitions into matchings and coverings in mixed graphs
From the strong differential to Italian domination in graphs
On the strong metric dimension of the strong products of graphs
Graphs with equal domination and covering numbers
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
On generalized Sierpiński graphs
Edge-covers in \(d\)-interval hypergraphs
On the super domination number of lexicographic product graphs
Forbidden subgraphs and the König-Egerváry property
On \(k\)-domination and \(j\)-independence in 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
The price of defense
Forbidden subgraphs and the Kőnig property
Outer independent Roman dominating functions in graphs
The private neighbor concept
Domination in digraphs
Models of domination in graphs
On vertex independence number of uniform hypergraphs
On the strong metric dimension of Cartesian and direct products of graphs
2-Matchings and 2-covers of hypergraphs
Directed domination in oriented graphs
scientific article; zbMATH DE number 2065948 (Why is no real title available?)
scientific article; zbMATH DE number 3550 (Why is no real title available?)
scientific article; zbMATH DE number 817208 (Why is no real title available?)
A superlocal version of Reed's conjecture
Claw-free graphs, skeletal graphs, and a stronger conjecture on , , and
Outer independent rainbow dominating functions in graphs
Remarks on the outer-independent double Italian domination number
Outer independent global dominating set of trees and unicyclic graphs
Double outer-independent domination number of graphs
D-Mycielskian graph of a graph
On the perfect differential of a graph
The total co-independent domination number of some graph operations
On edge product cordial graphs
On the edge geodetic and edge geodetic domination numbers of a graph
Strong vb-dominating and vb-independent sets of a graph
Approximation algorithms in combinatorial scientific computing
scientific article; zbMATH DE number 7057487 (Why is no real title available?)
My top 10 graph theory conjectures and open problems
Complexity and approximation of the constrained forest problem
On odd circuits in chromatic graphs
On Minimal Blocks
A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
Classification of trees by Laplacian eigenvalue distribution and edge covering number
Establishing herd immunity is hard even in simple geometric networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3270978)