Bruce A. Hedman
From MaRDI portal
Person:1969916
Available identifiers
zbMath Open hedman.bruce-aMaRDI QIDQ1969916
List of research outcomes
| Publication | Date of Publication | Type |
|---|---|---|
| Colin Maclaurin's Quaint Word Problems | 2002-10-17 | Paper |
| An earlier date for ``Cramer's rule | 2000-06-22 | Paper |
| Another extremal problem for Turan graphs | 1987-01-01 | Paper |
| A polynomial algorithm for constructing the clique graph of a line graph | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786501 | 1986-01-01 | Paper |
| The maximum number of cliques in dense graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322146 | 1985-01-01 | Paper |
| Clique graphs of time graphs | 1984-01-01 | Paper |
| n-bathycenters | 1976-01-01 | Paper |
| A Sufficient Condition for n-Short-Connectedness | 1974-01-01 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
| Property | Value |
|---|---|
| MaRDI profile type | MaRDI person profile |
| instance of | human |
This page was built for person: Bruce A. Hedman
