Maximum pebbling number of graphs of diameter three.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 4, p. 353
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2006 AND VI 52 AND IP 4
Results: 6
1
2
Cubic s‐regular graphs of order 2p3.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 4, p. 341
- By:
- Publication type:
- Article
3
On the circular chromatic number of circular partitionable graphs.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 4, p. 294
- By:
- Publication type:
- Article
4
Rank‐tolerance graph classes.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 4, p. 317
- By:
- Publication type:
- Article
5
On the strong circular 5‐flow conjecture.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 4, p. 307
- By:
- Publication type:
- Article
6
The k‐piece packing problem.
- Published in:
- Journal of Graph Theory, 2006, v. 52, n. 4, p. 267
- By:
- Publication type:
- Article