Bounding the size of near hexagons with lines of size 3.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 2, p. 108
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2006 AND VI 52 AND IP 2
Results: 7
1
2
Iterated line graphs are maximally ordered.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 2, p. 171
- By:
- Publication type:
- Article
3
Cycle lengths in graphs with large minimum degree.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 2, p. 157
- By:
- Publication type:
- Article
4
Claw‐decompositions and tutte‐orientationsThis work was done while Janos Barat was a Marie Curie Fellow at the Technical University of Denmark under the supervision of Dr. Thomassen.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 2, p. 135
- By:
- Publication type:
- Article
5
On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 2, p. 147
- By:
- Publication type:
- Article
6
How many graphs are unions of k‐cliques?Some of this research was carried out while G. R. B. was visiting the Isaac Newton Institute for Mathematical Sciences, Cambridge, U.K.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 2, p. 87
- By:
- Publication type:
- Article
7
On the asymptotic value of the choice number of complete multi‐partite graphs.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 2, p. 123
- By:
- Publication type:
- Article