Pages that link to "Item:Q4775897"
From MaRDI portal
The following pages link to Two Bounds for the Domination Number of a Graph (Q4775897):
Displayed 14 items.
- Gallai theorems for graphs, hypergraphs, and set systems (Q804601) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Chordal graphs and upper irredundance, upper domination and independence (Q1174126) (← links)
- The least point covering and domination numbers of a graph (Q1174131) (← links)
- Bounds for the covering number of a graph (Q1252353) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Strong weak domination and domination balance in a graph (Q1356427) (← 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)
- Generalized independence and domination in graphs (Q1584435) (← links)
- Well irredundant graphs (Q1917235) (← links)
- Critical concepts in domination (Q2277481) (← links)
- Factor domination in graphs (Q2641315) (← links)
