CPC
2007
13 years 5 months ago
2007
CPC
2007
13 years 5 months ago
2007
CPC
2007
13 years 5 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
CPC
2007
13 years 5 months ago
2007
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...