Pages that link to "Item:Q804601"
From MaRDI portal
The following pages link to Gallai theorems for graphs, hypergraphs, and set systems (Q804601):
Displaying 10 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Graphs with constant sum of domination and inverse domination numbers (Q446329) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On generalised minimal domination parameters for paths (Q1174129) (← links)
- Extensions of Gallai's graph covering theorems for uniform hypergraphs (Q1179466) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Gallai-type theorems and domination parameters (Q1356464) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- Well irredundant graphs (Q1917235) (← links)
