The following pages link to (Q5544082):
Displaying 4 items.
- Some upper bounds for the product of the domination number and the chromatic number of a graph (Q685554) (← links)
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757) (← links)
- Inequalities between the domination number and the chromatic number of a graph (Q1121277) (← links)
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (Q1405121) (← links)
