Abstract
We prove for k at most 10, that every graph of chromatic number k with a unique k-coloring admits a clique minor of order k.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.