3 search results - page 1 / 1 » On a Problem of Cameron's on Inexhaustible Graphs |
COMBINATORICA
2004
13 years 6 months ago
2004
JGT
2010
13 years 1 months ago
2010
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
ANOR
2005
13 years 6 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...