Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs.
- Published in:
- Networks, 2004, v. 44, n. 4, p. 302, doi. 10.1002/net.20039
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2004 AND VI 44 AND IP 4
Results: 8
1
2
The Push Tree problem.
- Published in:
- Networks, 2004, v. 44, n. 4, p. 281, doi. 10.1002/net.20038
- By:
- Publication type:
- Article
3
Bounding vertex coloring by truncated multistage branch and bound.
- Published in:
- Networks, 2004, v. 44, n. 4, p. 231, doi. 10.1002/net.20035
- By:
- Publication type:
- Article
4
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees.
- Published in:
- Networks, 2004, v. 44, n. 4, p. 254, doi. 10.1002/net.20034
- By:
- Publication type:
- Article
5
The proof of a conjecture of Bouabdallah and Sotteau.
- Published in:
- Networks, 2004, v. 44, n. 4, p. 292, doi. 10.1002/net.20041
- By:
- Publication type:
- Article
6
Minimum k-geodetically connected digraphs.
- Published in:
- Networks, 2004, v. 44, n. 4, p. 243, doi. 10.1002/net.30036
- By:
- Publication type:
- Article
7
A network flow approach to cost allocation for rooted trees.
- Published in:
- Networks, 2004, v. 44, n. 4, p. 297, doi. 10.1002/net.20040
- By:
- Publication type:
- Article
8
On d-threshold graphs and d-dimensional bin packing.
- Published in:
- Networks, 2004, v. 44, n. 4, p. 266, doi. 10.1002/net.20037
- By:
- Publication type:
- Article