scientific article; zbMATH DE number 3613077
From MaRDI portal
Publication:4177597
Cited in
(6)- Game-perfect digraphs
- New results in \(t\)-tone coloring of graphs
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Game-perfect graphs
- Planar graphs without 4- and 6-cycles are (7 : 2)-colorable
- On the fractional chromatic number and the lexicographic product of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177597)