Graham Farr

Graphs Comb., 2021

On the Strong Hanani-Tutte Theorem.

[BibT_eX]

[DOI]

Hooman Reisi Dehkordi

Electron. J. Comb., 2021

Non-Separating Planar Graphs.

[BibT_eX]

[DOI]

Hooman Reisi Dehkordi

Electron. J. Comb., 2021

2020

A survey of repositories in graph theory.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Using Go in teaching the theory of computation.

[BibT_eX]

[DOI]

SIGACT News, 2019

Short certificates for chromatic equivalence.

[BibT_eX]

[DOI]

Zoë Bukovac

J. Graph Algorithms Appl., 2019

2018

The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games.

[BibT_eX]

[DOI]

Nhan Bao Ho

Theor. Comput. Sci., 2018

Tutte Invariants for Alternating Dimaps.

[BibT_eX]

[DOI]

Kai Siong Yow

CoRR, 2018

2017

Topological containment of the 5-clique minus an edge in 4-connected graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Computer History on the Move.

[BibT_eX]

[DOI]

Proceedings of the 47th ACM Technical Symposium on Computing Science Education, 2016

2015

Cost-effectiveness of algorithms.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2015

2014

Graphs with no 7-wheel subdivision.

[BibT_eX]

[DOI]

Discret. Math., 2014

Certificates for Properties of Stability Polynomials of Graphs.

[BibT_eX]

[DOI]

Ranjie Mo

Electron. J. Comb., 2014

2013

Search strategies for developing characterizations of graphs without small wheel subdivisions.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Non-bipartite chromatic factors.

[BibT_eX]

[DOI]

Discret. Math., 2012

Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2009

Certificates of Factorisation for a Class of Triangle-Free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Certificates of Factorisation for Chromatic Polynomials.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Structure and Recognition of Graphs with No 6-wheel Subdivision.

[BibT_eX]

[DOI]

Algorithmica, 2009

2008

On the number of Go positions on lattice graphs.

[BibT_eX]

[DOI]

Johannes Schmidt

Inf. Process. Lett., 2008

Planarization and fragmentability of some classes of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2007

2006

On pedagogically sound examples in public-key cryptography.

[BibT_eX]

[DOI]

Proceedings of the Computer Science 2006, 2006

2005

On monochromatic component size for improper colourings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

Some results on generalised Whitney functions.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

2003

Skewness of Graphs with Small Cutsets.

[BibT_eX]

[DOI]

Peter Eades

Graphs Comb., 2003

2001

Fragmentability of Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2001

An Algorithm for Finding Large Induced Planar Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

1994

On Problems with Short Certificates.

[BibT_eX]

[DOI]

Acta Informatica, 1994

1988

The subgraph homeomorphism problem for small wheels.

[BibT_eX]

[DOI]

Discret. Math., 1988

The complexity of multicolouring.

[BibT_eX]

[DOI]

Discret. Math., 1988

1985

The Compexity of Counting Homeomorphs.

[BibT_eX]

[DOI]