<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2006-08-20 07:45:17Graph Combinatorics Ramsey theory Uniquely colorable graph Friendship graph Graph theory Extremal graph theory Turán graph |
| 3-coloring triangle-free planar graphs with a precolored 9-cycle Ilkyoo Choi, Jan Ekstein, Pˇremysl Holub, Bernard Lidick´y Korea Advanced Institute of Science and Technology, Korea University of West Bohemia, Czech ReDocID: 1oUuj - View Document |
| On Coloring Resilient Graphs Jeremy Kun, Lev Reyzin University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science MFCS14, August 28, 2014DocID: 1mvXj - View Document |
| LNCSOn Coloring Resilient GraphsDocID: 1mk6G - View Document |
| CCCG 2009, Vancouver, BC, August 17–19, 2009 Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice David Flores-Peñaloza∗DocID: 1898O - View Document |
| Testing k-colorability Noga AlonDocID: 3vsr - View Document |