Gary Haggard

Available identifiers

zbMath Open haggard.garyMaRDI QIDQ1222169

List of research outcomes

Publication	Date of Publication	Type
Computing Tutte polynomials	2017-05-19	Paper
Discrete mathematics for computer science. With CD-ROM	2016-01-26	Paper
Edge-selection heuristics for computing Tutte polynomials	2014-05-06	Paper
https://portal.mardi4nfdi.de/entity/Q5463586	2005-08-04	Paper
Using thresholds to compute chromatic polynomials.	2005-07-20	Paper
The computation of chromatic polynomials	1999-08-09	Paper
https://portal.mardi4nfdi.de/entity/Q4393298	1998-06-08	Paper
https://portal.mardi4nfdi.de/entity/Q4390682	1998-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q4868194	1996-07-17	Paper
https://portal.mardi4nfdi.de/entity/Q4693380	1993-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q3887482	1980-01-01	Paper
Loops in Duals	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3922700	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4742808	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4148942	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4196446	1977-01-01	Paper
Extremal edge problems for graphs with given hyperoctahedral automorphism group	1976-01-01	Paper
Decomposition of complete graphs into trees	1975-01-01	Paper
The least number of edges for graphs having dihedral automorphism group	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4073397	1973-01-01	Paper
The genus of subgraphs of \(K_ 8\)	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5682331	1972-01-01	Paper
Special embeddings of the complete graph	1972-01-01	Paper
Jordan circuits of a graph	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5656782	1970-01-01	Paper

Research outcomes over time

This page was built for person: Gary Haggard