Decompositions of a complete multidigraph into nonhamiltonian paths.
- Published in:
- Journal of Graph Theory, 2006, v. 51, n. 1, p. 82
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2006 AND VI 51 AND IP 1
Results: 7
1
2
New upper bounds on the decomposability of planar graphsThe first author is supported by Norges forskningsråd projects 162731/V00 and 160778/V30. The second author is supported by the Spanish CICYT project TIN‐2004‐07925 (GRAMMARS).
- Published in:
- Journal of Graph Theory, 2006, v. 51, n. 1, p. 53
- By:
- Publication type:
- Article
3
Edge‐disjoint Hamiltonian cycles in hypertournaments.
- Published in:
- Journal of Graph Theory, 2006, v. 51, n. 1, p. 49
- By:
- Publication type:
- Article
4
Moments of graphs in monotone families.
- Published in:
- Journal of Graph Theory, 2006, v. 51, n. 1, p. 37
- By:
- Publication type:
- Article
5
Ramsey unsaturated and saturated graphs.
- Published in:
- Journal of Graph Theory, 2006, v. 51, n. 1, p. 22
- By:
- Publication type:
- Article
6
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak‐Rödl function.
- Published in:
- Journal of Graph Theory, 2006, v. 51, n. 1, p. 33
- By:
- Publication type:
- Article
7
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groupsPart of this research was conducted at Cornell University, Ithaca, New York 14853‐4201.
- Published in:
- Journal of Graph Theory, 2006, v. 51, n. 1, p. 1
- By:
- Publication type:
- Article