Found: 8
Select item for more details and to access through your institution.
A eulogy for Frank Boesch.
- Published in:
- Networks, 2009, v. 54, n. 2, p. 69, doi. 10.1002/net.20294
- By:
- Publication type:
- Article
Liar's domination.
- Published in:
- Networks, 2009, v. 54, n. 2, p. 70, doi. 10.1002/net.20295
- By:
- Publication type:
- Article
The rainbow connectivity of a graph.
- Published in:
- Networks, 2009, v. 54, n. 2, p. 75, doi. 10.1002/net.20296
- By:
- Publication type:
- Article
A generalization of an edge-connectivity theorem of Chartrand.
- Published in:
- Networks, 2009, v. 54, n. 2, p. 82, doi. 10.1002/net.20297
- By:
- Publication type:
- Article
Packing the Steiner trees of a graph.
- Published in:
- Networks, 2009, v. 54, n. 2, p. 90, doi. 10.1002/net.20298
- By:
- Publication type:
- Article
Sufficient degree conditions for k-edge-connectedness of a graph.
- Published in:
- Networks, 2009, v. 54, n. 2, p. 95, doi. 10.1002/net.20299
- By:
- Publication type:
- Article
A survey of some network reliability analysis and synthesis results.
- Published in:
- Networks, 2009, v. 54, n. 2, p. 99, doi. 10.1002/net.20300
- By:
- Publication type:
- Article
On the roots of strongly connected reliability polynomials.
- Published in:
- Networks, 2009, v. 54, n. 2, p. 108, doi. 10.1002/net.20301
- By:
- Publication type:
- Article