Gary Haggard

From MaRDI portal
Person:1222169

Available identifiers

zbMath Open haggard.garyMaRDI QIDQ1222169

List of research outcomes





PublicationDate of PublicationType
Computing Tutte polynomials2017-05-19Paper
Discrete mathematics for computer science. With CD-ROM2016-01-26Paper
Edge-selection heuristics for computing Tutte polynomials2014-05-06Paper
https://portal.mardi4nfdi.de/entity/Q54635862005-08-04Paper
Using thresholds to compute chromatic polynomials.2005-07-20Paper
The computation of chromatic polynomials1999-08-09Paper
https://portal.mardi4nfdi.de/entity/Q43932981998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43906821998-05-26Paper
https://portal.mardi4nfdi.de/entity/Q48681941996-07-17Paper
https://portal.mardi4nfdi.de/entity/Q46933801993-08-17Paper
https://portal.mardi4nfdi.de/entity/Q38874821980-01-01Paper
Loops in Duals1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39227001979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47428081979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41489421978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41964461977-01-01Paper
Extremal edge problems for graphs with given hyperoctahedral automorphism group1976-01-01Paper
Decomposition of complete graphs into trees1975-01-01Paper
The least number of edges for graphs having dihedral automorphism group1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40733971973-01-01Paper
The genus of subgraphs of \(K_ 8\)1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56823311972-01-01Paper
Special embeddings of the complete graph1972-01-01Paper
Jordan circuits of a graph1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56567821970-01-01Paper

Research outcomes over time

This page was built for person: Gary Haggard