Maximum versus minimum invariants for graphs
From MaRDI portal
Publication:3661618
Cites work
Cited in
(6)- Covering and packing in graphs. V. Mispacking subcubes in hypercubes
- The b-chromatic number of a graph
- Interpolation theorems for domination numbers of a graph
- scientific article; zbMATH DE number 3961651 (Why is no real title available?)
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
- A survey of the theory of hypercube graphs
This page was built for publication: Maximum versus minimum invariants for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661618)