A Sufficient Condition for n-Short-Connectedness

• Authors : Hedman, Bruce

• Source: Mathematics Magazine, 1974 May 01. 47(3), 156-157.

Record details

n-bathycenters

• Authors : Hedman, Bruce

• Source: Geometriae Dedicata; May 1976, Vol. 5 Issue: 1 p51-70, 20p

Record details

Eighteenth Sunday After Pentecost.

• Authors : Hedman, Bruce

• Source: Expository Times; Sep1979, Vol. 90 Issue 12, p368-369, 2p

Record details

Second law analysis of industrial processes

• Authors : Hedman, Bruce A.; Brown, Harry L.; Hamel, Bernard B.

• Source: In Energy 1980 5(8):931-936

Record details

Clique graphs of time graphs

• Authors : Hedman, Bruce

• Source: In Journal of Combinatorial Theory, Series B 1984 37(3):270-278

Record details

The maximum number of cliques in dense graphs

• Authors : Hedman, Bruce

• Source: In Discrete Mathematics 1985 54(2):161-166

Record details

A polynomial algorithm for constructing the clique graph of a line graph

• Authors : Hedman, Bruce

• Source: In Discrete Applied Mathematics 1986 15(1):61-66

Record details

Another extremal problem for Turan graphs

• Authors : Hedman, Bruce

• Source: In Discrete Mathematics 1987 65(2):173-176

Record details

An Earlier Date for “Cramer's Rule”

• Authors : Hedman, Bruce A.

• Source: In Historia Mathematica November 1999 26(4):365-368

Record details

Volume 15, Number 1, 2000 (Newsletter 41).

• Source: British Society for the History of Mathematics. Newsletter; Mar2000, Vol. 15 Issue 1, p1-74, 74p

Record details