11 citations · 13 across the 6 of their papers we have counts for
6 papers
On uniquely k-list colorable planar graphs, graphs on surfaces, and regular graphs
M. Abdolmaleki, J. P. Hutchinson, S. Gh. Ilchi +2
A graph is called uniquely k-list colorable (ULC) if there exists a list of colors on its vertices, say , each of size , such that…
Revisiting a Nice Cycle Lemma and its Consequences
M. O. Albertson, J. P. Hutchinson, R. B. Richter
We correct some errors and omissions primarily in a paper [Albertson&Hutchinson2004], discovered by R.B. Richter, and also some in a proof of [Thomassen1993] and of [Yu1997]. We gi…
A variation on Heawood list-coloring for graphs on surfaces
Joan P. Hutchinson
We prove a variation on Heawood list-coloring for graphs on surfaces, modeled on Thomassen's planar 5-list-coloring theorem. For epsilon>0 define the Heawood number to be H(epsilon…
List-coloring graphs on surfaces with varying list-sizes
Alice M. Dean, Joan P. Hutchinson
Let be a graph embedded on a surface with Euler genus , and let be a set of vertices mutually at distance at least 4 apart. S…
List precoloring extension in planar graphs
Maria Axenovich, Joan P. Hutchinson, Michelle A. Lastrina
A celebrated result of Thomassen states that not only can every planar graph be colored properly with five colors, but no matter how arbitrary palettes of five colors are assigned…
Unit Rectangle Visibility Graphs
Alice Dean, Joanna A. Ellis-Monaghan, Sarah Hamilton +1
Over the past twenty years, rectangle visibility graphs have generated considerable interest, in part due to their applicability to VLSI chip design. Here we study unit rectangle v…