Found: 5
Select item for more details and to access through your institution.
Universal graphs with a forbidden near‐path or 2‐bouquet.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 1, p. 41
- By:
- Publication type:
- Article
Interval Tournaments.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 1, p. 72
- By:
- Publication type:
- Article
T‐joins intersecting small edge‐cuts in graphs.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 1, p. 64
- By:
- Publication type:
- Article
Tough spiders.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 1, p. 23
- By:
- Publication type:
- Article
A result on extendibility in the powers of graphs.
- Published in:
- Journal of Graph Theory, 2007, v. 56, n. 1, p. 1
- By:
- Publication type:
- Article