Gallai-type theorems and domination parameters
From MaRDI portal
Publication:1356464
DOI10.1016/S0012-365X(97)00231-8zbMath0872.05021MaRDI QIDQ1356464
Lisa R. Markus, Gayla S. Domke, Jean E. Dunbar
Publication date: 7 October 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (9)
Isolate domination in graphs ⋮ Laplacian distribution and domination ⋮ Extremal graphs for a new upper bound on domination parameters in graphs ⋮ Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance ⋮ Kernels for packing and covering problems ⋮ Irredundance ⋮ \(\beta\)-differential of a graph ⋮ Inequalities involving the irredundance number of a graph ⋮ Independent domination of graphs with bounded maximum degree
Cites Work
- Unnamed Item
- Gallai theorems for graphs, hypergraphs, and set systems
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Properties of Hereditary Hypergraphs and Middle Graphs
- Two Bounds for the Domination Number of a Graph
This page was built for publication: Gallai-type theorems and domination parameters
