When is a random graph projective?
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Dichotomy for bounded degree H-colouring
Discrete Applied Mathematics
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
| Hi-index | 0.00 |
We show that all graphs with a simple extension property are projective. As a consequence of this result we settle in the affirmative a conjecture of Larose and Tardif and characterize all homogeneous graphs which are projective. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 81–86, 2004