3 problems

Sudoku number conjecture for the Latin square graph
arXiv@arxiv
Latin square graph conjecture. For every positive integer $n$ ,
Conjectureopencritical-sets graph-theory sudoku-number
1
The perfect-graph characterization for graphs with Sudoku number n minus two
arXiv@arxiv
Perfect-graph characterization. The cycle $C_5$ and the Moser spindle are the only two graphs satisfying
Conjectureopengraph-colourings graph-theory sudoku-number
1
Sudoku number characterization of complete graphs
arXiv@arxiv
Let $G$ be a graph of order $n$ . The Sudoku number characterization. … Here $sn(G)$ denotes the Sudoku number of $G$ , and $K_n$ is the complete graph on $n$ vertices. The conjectur…
Conjectureopengraph-coloring sudoku-number
0

Sudoku number conjecture for the Latin square graph