The following pages link to (Q3270978):
Displaying 50 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- A superlocal version of Reed's conjecture (Q490262) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- On the distribution of Laplacian eigenvalues of a graph (Q644659) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- A matroid generalization of theorems of Lewin and Gallai (Q798663) (← links)
- Gallai theorems for graphs, hypergraphs, and set systems (Q804601) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- The strong metric dimension of graphs and digraphs (Q868391) (← links)
- Matchings in simplicial complexes, circuits and toric varieties (Q868883) (← links)
- On strong (weak) independent sets and vertex coverings of a graph (Q870977) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Disjoint paths in a rectilinear grid (Q1051655) (← links)
- A note on total domination (Q1065020) (← links)
- Equivalence between the minimum covering problem and the maximum matching problem (Q1068107) (← links)
- Maximum matchings in a class of random graphs (Q1093654) (← links)
- Fractional matchings and the Edmonds-Gallai theorem (Q1098861) (← links)
- A survey of the theory of hypercube graphs (Q1102985) (← links)
- A decomposition strategy for the vertex cover problem (Q1123907) (← links)
- The cochromatic index of a graph (Q1144036) (← links)
- Packing and covering with matroid circuits (Q1146680) (← links)
- On Petersen's graph theorem (Q1148334) (← links)
- On generalised minimal domination parameters for paths (Q1174129) (← links)
- Covering all cliques of a graph (Q1174130) (← links)
- Extensions of Gallai's graph covering theorems for uniform hypergraphs (Q1179466) (← links)
- Minimum spectral radius of a weighted graph (Q1188417) (← links)
- On total covering and matching of graphs (Q1247440) (← links)
- On complementary graphs with no isolated vertices (Q1252360) (← links)
- A constructive characterization of trees with at least k disjoint maximum matchings (Q1258751) (← links)
- Note on a matroid with parity condition (Q1262317) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- On graphs with equal domination and covering numbers (Q1329822) (← links)
- Gallai-type theorems and domination parameters (Q1356464) (← links)
- On weakly connected domination in graphs (Q1356466) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- Relations between the lower domination parameters and the chromatic number of a graph. (Q1421509) (← links)
- Interpolation theorems for graphs, hypergraphs and matroids (Q1584241) (← links)
- Characterization of graphs with equal domination and covering number (Q1584421) (← links)
- Generalized independence and domination in graphs (Q1584435) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- Metabolic networks are NP-hard to reconstruct (Q1797721) (← links)
- Tibor Gallai - seventy years old (Q1837176) (← links)
- Tibor Gallai (Q1838469) (← links)
- Covers in hypergraphs (Q1838499) (← links)
- The chromatic number and other functions of the lexicographic product (Q1843453) (← links)
