Searching for "On uniquely 3-colorable graphs." – sorted by Relevance.
-
An algebraic characterization of uniquely vertex colorable graphs
- counterexample to a conjecture of Xu concerning uniquely 3-colorable graphs without triangles. 1. Introduction
- Cited by 4 (0 self) – Add To MetaCart
-
K r -free Uniquely Vertex Colorable Graphs
- r 3, there is a uniquely r-colorable graph which contains no subgraph isomorphic to K r ." Several
- Add To MetaCart

