Nowhere‐zero 3‐flows in products of graphs.
- Published in:
- Journal of Graph Theory, 2005, v. 50, n. 1, p. 79
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2005 AND VI 50 AND IP 1
Results: 6
1
2
Degree bounds for the circumference of 3‐connected graphs.
- Published in:
- Journal of Graph Theory, 2005, v. 50, n. 1, p. 55
- By:
- Publication type:
- Article
3
An improvement of the crossing number bound.
- Published in:
- Journal of Graph Theory, 2005, v. 50, n. 1, p. 43
- By:
- Publication type:
- Article
4
The edge‐transitive but not vertex‐transitive cubic graph on 112 verticesPart of this paper was written while the author was Visiting Neil R. Grabois Professor of Mathematics at Colgate University.
- Published in:
- Journal of Graph Theory, 2005, v. 50, n. 1, p. 25
- By:
- Publication type:
- Article
5
Normal cirulant graphs with noncyclic regular subroups.
- Published in:
- Journal of Graph Theory, 2005, v. 50, n. 1, p. 13
- By:
- Publication type:
- Article
6
Forbidden subgraphs and bounds on the size of a maximum matching.
- Published in:
- Journal of Graph Theory, 2005, v. 50, n. 1, p. 1
- By:
- Publication type:
- Article