Bounding functions and rigid graphs

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 2, 1996, Pages 269-273

  Albertson, Michael O ^a   Haas, Ruth ^a  

^a SMITH COLLEGE   (United States)

Author keywords

Extremal graph theory; Graphs

Indexed keywords

INFINITE GRAPH; SUBGRAPH;

GRAPH THEORY;

EID: 0030375006     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/0409023     Document Type: Article

References (4)

1. J. GRAVER AND B. SERVATIUS, Combinatorial Rigidity, Graduate Studies in Mathematics 2, American Mathematical Society, Providence, RI, 1993.
2. A. RECSKI, Matroid Theory and Its Applications in Electrical Network Theory and in Statics, Springer-Verlag, Berlin, 1989.
3. W. T. TUTTE, On the problem of decomposing a graph into n-connected factors, J. London Math. Soc., 36 (1961), pp. 221-230.
4. W. WHITELEY, Matroids and rigid structures, in Matroid Applications, N. White, ed., Encyclopedia of Mathematics and its Applications 40, Cambridge University Press, Cambridge, England, 1992, pp. 1-53.