GC
2002
Springer
13 years 4 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
COMBINATORICS
2007
13 years 4 months ago
2007
This work introduces the technique of using a carefully chosen determining set to prove the existence of a distinguishing labeling using few labels. A graph G is said to be d-dist...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...