51 search results - page 5 / 11 » jgt 2006 |
JGT
2006
14 years 11 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
JGT
2006
14 years 11 months ago
2006
Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...
JGT
2006
14 years 11 months ago
2006
This paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs have
103
click to vote
JGT
2010
14 years 10 months ago
2010
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class ...
JGT
2010
14 years 10 months ago
2010
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...