A. Hilton

activity

20112020

most citedAn analogue of Ryser's Theorem for partial Sudoku squares

5 citations · 8 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2020★ 1 cited

Bounds Related to The Edge-List Chromatic and Total Chromatic Numbers of a Simple Graph

M. Henderson, A. J. W. Hilton, R. Mary Jeya Jothi

We show that for a simple graph $G$ , $c^{'} (G) \leq Δ (G) + 2$ where $c^{'} (G)$ is the choice index (or edge-list chromatic number) of $G$ , and $Δ (G)$ is the maximum degree of $G$ . As a simpl…

math.CO2019

The simple graph threshold number $σ (r, s, a, t)$

A. J. W. Hilton, A. Rajkumar

For $d \geq 1$ , $s \geq 0$ a $(d, d + s)$ -{\em graph} is a graph whose degrees all lie in the interval ${d, d + 1, \dots, d + s}$ . For $r \geq 1$ , $a \geq 0$ , an $(r, r + a)$ -{\em factor}…

math.CO2011★ 5 cited

An analogue of Ryser's Theorem for partial Sudoku squares

P. J. Cameron, A. J. W. Hilton, E. R. Vaughan

In 1956 Ryser gave a necessary and sufficient condition for a partial latin rectangle to be completable to a latin square. In 1990 Hilton and Johnson showed that Ryser's condition…

math.CO2011★ 2 cited

Hall's Condition for Partial Latin Squares

A. J. W. Hilton, E. R. Vaughan

Hall's Condition is a necessary condition for a partial latin square to be completable. Hilton and Johnson showed that for a partial latin square whose filled cells form a rectangl…

Bounds Related to The Edge-List Chromatic and Total Chromatic Numbers of a Simple Graph

The simple graph threshold number σ(r,s,a,t)

An analogue of Ryser's Theorem for partial Sudoku squares

Hall's Condition for Partial Latin Squares

The simple graph threshold number $σ (r, s, a, t)$