Vertex coloring complete multipartite graphs from random lists of size 2
From MaRDI portal
(Redirected from Publication:539865)
Recommendations
Cites work
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Coloring complete bipartite graphs from random lists
- Colouring powers of cycles from random lists
- Multicriterial graph problems with MAXMIN criterion
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(6)- Coloring complete and complete bipartite graphs from random lists
- Coloring graphs from random lists of fixed size
- Coloring graphs from random lists of size 2
- Choosability with separation of complete multipartite graphs and hypergraphs
- Coloring hypergraphs from random lists
- Coloring complete bipartite graphs from random lists
This page was built for publication: Vertex coloring complete multipartite graphs from random lists of size 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539865)