Vertex-disjoint cycles of length at most four each of which contains a specified vertex*.
- Published in:
- Journal of Graph Theory, 2001, v. 37, n. 1, p. 37, doi. 10.1002/jgt.1002
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2001 AND VI 37 AND IP 1
Results: 4
1
2
Menger's Theorem.
- Published in:
- Journal of Graph Theory, 2001, v. 37, n. 1, p. 35, doi. 10.1002/jgt.1001
- By:
- Publication type:
- Article
3
Realizing finite edge-transitive orientable maps.
- Published in:
- Journal of Graph Theory, 2001, v. 37, n. 1, p. 1, doi. 10.1002/jgt.1000
- By:
- Publication type:
- Article
4
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs.
- Published in:
- Journal of Graph Theory, 2001, v. 37, n. 1, p. 48, doi. 10.1002/jgt.1003
- By:
- Publication type:
- Article