scientific article; zbMATH DE number 3258857
From MaRDI portal
Publication:5544082
zbMath0161.43305MaRDI QIDQ5544082
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Inequalities between the domination number and the chromatic number of a graph ⋮ Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs ⋮ Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture ⋮ Some upper bounds for the product of the domination number and the chromatic number of a graph
