David B. Chandler

Recognition of probe cographs and partitioned probe distance hereditary graphs

Given a class of graphs

Cyclic Relative Difference Sets and their p -Ranks

{\cal G}

Partitioned probe comparability graphs

, a graph G is a probe graph of

The invariant factors of some cyclic difference sets

{\cal G}

On probe permutation graphs

if its vertices can be partitioned into two sets ℙ (the probes) and ℕ (nonprobes), where ℕ is an independent set, such that G can be embedded into a graph of

Probe Matrix Problems: Totally Balanced Matrices

{\cal G}

Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2

by adding edges between certain vertices of ℕ. If the partition of the vertices into probes and nonprobes is part of the input, then we call the graph a partitioned probe graph of

Probe Ptolemaic Graphs

{\cal G}

The invariant factors of the incidence matrices of points and subspaces in (,) and (,)

. We give the first polynomial-time algorithm for recognizing partitioned probe distance-hereditary graphs. By using a novel data structure for storing a multiset of sets of numbers, the running time of this algorithm is

The sizes of the intersections of two unitals in PG(2, q2)

{O}(\mathfrak\it{n}^2)