Recursive constructions for triangulations.
- Published in:
- Journal of Graph Theory, 2002, v. 39, n. 2, p. 87, doi. 10.1002/jgt.10014
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2002 AND VI 39 AND IP 2
Results: 5
1
2
K<sub>4</sub><sup>−</sup>-factor in a graph.
- Published in:
- Journal of Graph Theory, 2002, v. 39, n. 2, p. 111, doi. 10.1002/jgt.10007
- By:
- Publication type:
- Article
3
On Vertices of outdegree n in minimally n-connected digraphs.
- Published in:
- Journal of Graph Theory, 2002, v. 39, n. 2, p. 129, doi. 10.1002/jgt.10018
- By:
- Publication type:
- Article
4
A rigid graph for every set.
- Published in:
- Journal of Graph Theory, 2002, v. 39, n. 2, p. 108, doi. 10.1002/jgt.10013
- By:
- Publication type:
- Article
5
Circuits through prescribed vertices in k-connected k-regular graphs.
- Published in:
- Journal of Graph Theory, 2002, v. 39, n. 2, p. 145, doi. 10.1002/jgt.10011
- By:
- Publication type:
- Article