×
Author ID: haggard.gary Recent zbMATH articles by "Haggard, Gary"
Published as: Haggard, Gary; Haggard, G.
Documents Indexed: 25 Publications since 1970, including 2 Books
Co-Authors: 13 Co-Authors with 13 Joint Publications
299 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

15 Publications have been cited 42 times in 34 Documents Cited by Year
Computing Tutte polynomials. Zbl 1364.05072
Haggard, Gary; Pearce, David J.; Royle, Gordon
10
2010
The least number of edges for graphs having dihedral automorphism group. Zbl 0263.05111
Haggard, Gary
9
1973
Extremal edge problems for graphs with given hyperoctahedral automorphism group. Zbl 0318.05105
Haggard, Gary; McCarthy, Donald; Wohlgemuth, Andrew
5
1976
The genus of subgraphs of \(K_ 8\). Zbl 0234.05102
Duke, R. A.; Haggard, G.
3
1972
Edmonds characterization of disc embeddings. Zbl 0409.05029
Haggard, Gary
3
1977
Computing chromatic polynomials of large graphs. I. Zbl 0830.05030
Haggard, Gary
2
1993
On the function N(3,2,\(\lambda\),v). Zbl 0265.05005
Haggard, Gary
2
1972
Chromatic polynomials of large graphs. II: Isomorphism abstract data type for small graphs. Zbl 0842.05036
Haggard, Gary; Read, Ron
1
1993
Using thresholds to compute chromatic polynomials. Zbl 1065.05087
Haggard, Gary; Mathies, Thomas R.
1
2001
Exposition of the construction of 103 irreducible graphs for the projective plane. Zbl 0469.05029
Haggard, Gary
1
1979
The computation of chromatic polynomials. Zbl 0933.05055
Haggard, Gary; Mathies, Thomas R.
1
1999
Decomposition of complete graphs into trees. Zbl 0436.05051
Haggard, Gary; McWha, Peter
1
1975
Excursions in graph theory. Zbl 0444.05036
Haggard, Gary
1
1980
Loops in duals. Zbl 0444.05038
Haggard, Gary
1
1980
Edge-selection heuristics for computing Tutte polynomials. Zbl 1286.05073
Pearce, David J.; Haggard, Gary; Royle, Gordon
1
2010
Computing Tutte polynomials. Zbl 1364.05072
Haggard, Gary; Pearce, David J.; Royle, Gordon
10
2010
Edge-selection heuristics for computing Tutte polynomials. Zbl 1286.05073
Pearce, David J.; Haggard, Gary; Royle, Gordon
1
2010
Using thresholds to compute chromatic polynomials. Zbl 1065.05087
Haggard, Gary; Mathies, Thomas R.
1
2001
The computation of chromatic polynomials. Zbl 0933.05055
Haggard, Gary; Mathies, Thomas R.
1
1999
Computing chromatic polynomials of large graphs. I. Zbl 0830.05030
Haggard, Gary
2
1993
Chromatic polynomials of large graphs. II: Isomorphism abstract data type for small graphs. Zbl 0842.05036
Haggard, Gary; Read, Ron
1
1993
Excursions in graph theory. Zbl 0444.05036
Haggard, Gary
1
1980
Loops in duals. Zbl 0444.05038
Haggard, Gary
1
1980
Exposition of the construction of 103 irreducible graphs for the projective plane. Zbl 0469.05029
Haggard, Gary
1
1979
Edmonds characterization of disc embeddings. Zbl 0409.05029
Haggard, Gary
3
1977
Extremal edge problems for graphs with given hyperoctahedral automorphism group. Zbl 0318.05105
Haggard, Gary; McCarthy, Donald; Wohlgemuth, Andrew
5
1976
Decomposition of complete graphs into trees. Zbl 0436.05051
Haggard, Gary; McWha, Peter
1
1975
The least number of edges for graphs having dihedral automorphism group. Zbl 0263.05111
Haggard, Gary
9
1973
The genus of subgraphs of \(K_ 8\). Zbl 0234.05102
Duke, R. A.; Haggard, G.
3
1972
On the function N(3,2,\(\lambda\),v). Zbl 0265.05005
Haggard, Gary
2
1972

Citations by Year