Anthony J. W. Hilton

Affiliations:
  • University of Reading, Department of Mathematics and Statistics, Whiteknights, UK


According to our database1, Anthony J. W. Hilton authored at least 89 papers between 1972 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On Completing Partial Latin Squares with Prescribed Diagonals.
Electron. J. Comb., 2022

2019
Several families with incomparability and complementarity conditions.
Discret. Appl. Math., 2019

2016
The pseudograph (r, s, a, t)-threshold number.
Discret. Appl. Math., 2016

2015
Hall's theorem and extending partial latinized rectangles.
J. Comb. Theory, Ser. A, 2015

2013
Wiggles and Finitely Discontinuous <i>k</i>-to-1 Functions Between Graphs.
J. Graph Theory, 2013

2011
Completing partial latin squares: Cropper's question.
Australas. J Comb., 2011

2010
Continuous <i>k</i>-to-1 functions between complete graphs whose orders are of a different parity.
J. Graph Theory, 2010

List multicoloring problems involving the <i>k</i>-fold Hall numbers.
J. Graph Theory, 2010

Degree-bounded factorizations of bipartite multigraphs and of pseudographs.
Discret. Math., 2010

Continuous k-to-1 functions between complete graphs of even order.
Discret. Math., 2010

2009
On the number of (<i>r, r</i>+1)- factors in an (<i>r, r</i>+1)-factorization of a simple graph.
J. Graph Theory, 2009

A generalization of Talbot's theorem about King Arthur and his Knights of the Round Table.
J. Comb. Theory, Ser. A, 2009

An application of Tutte's Theorem to 1-factorization of regular graphs of high degree.
Discret. Math., 2009

2008
(r, r+1)-factorizations of (d, d+1)-graphs.
Discret. Math., 2008

2007
List multicolorings of graphs with measurable sets.
J. Graph Theory, 2007

2006
Cycle decompositions of the complete graph.
Ars Comb., 2006

2005
Amalgamating infinite latin squares.
Discret. Math., 2005

Two sufficient conditions for a graph to be type 1.
Ars Comb., 2005

2004
Amalgamations of factorizations of complete equipartite graphs.
Discret. Math., 2004

2003
An algorithm for finding factorizations of complete graphs.
J. Graph Theory, 2003

Hamiltonian double latin squares.
J. Comb. Theory, Ser. B, 2003

Amalgamations of connected k-factorizations.
J. Comb. Theory, Ser. B, 2003

The structure of totally critical graphs of odd order.
Discret. Math., 2003

The total chromatic numbers of joins of sparse graphs.
Australas. J Comb., 2003

2002
Hall parameters of complete and complete bipartite graphs.
J. Graph Theory, 2002

Non-conformable subgraphs of non-conformable graphs.
Discret. Math., 2002

2001
Aspects of edge list-colourings.
Discret. Math., 2001

The Overfull Conjecture and the Conformability Conjecture.
Discret. Math., 2001

Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs.
Discret. Math., 2001

2000
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs.
J. Graph Theory, 2000

A Sufficient Condition For A Graph To Be The Core Of A Class 2 Graph.
Comb. Probab. Comput., 2000

Progress on the Hall-Number-Two problem.
Australas. J Comb., 2000

1999
Totally Critical Even Order Graphs.
J. Comb. Theory, Ser. B, 1999

The Hall Number, the Hall Index, and the Total Hall Number of a Graph.
Discret. Appl. Math., 1999

1998
A Vertex-Splitting Lemma, de Werra's Theorem, and Improper List Colourings.
J. Comb. Theory, Ser. B, 1998

1997
Coloring graphs which have equibipartite complements.
J. Graph Theory, 1997

Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares.
Discret. Math., 1997

Vertex-splitting and Chromatic Index Critical Graphs.
Discret. Appl. Math., 1997

1996
At most k-to-1 mappings between graphs, II.
Discret. Math., 1996

Graphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle.
Discret. Appl. Math., 1996

1995
Disconnection numbers, pizza cuts, and cycle rank.
Ars Comb., 1995

1994
A sufficient condition for equitable edge-colourings of simple graphs.
Discret. Math., 1994

The total chromatic number of regular graphs whose complement is bipartite.
Discret. Math., 1994

Amalgemated Factorizations of Complete Graphs.
Comb. Probab. Comput., 1994

1993
A sufficient condition for a regular graph to be class 1.
J. Graph Theory, 1993

The existence of <i>k</i>-to-1 continuous maps between graphs when <i>k</i> is sufficiently large.
J. Graph Theory, 1993

The total chromatic number of graphs having large maximum degree.
Discret. Math., 1993

Recent results on the total chromatic number.
Discret. Math., 1993

1992
Alternating hamiltonian cycles in two colored complete bipartite graphs.
J. Graph Theory, 1992

The chromatic index of a graph whose core has maximum degree two.
Discret. Math., 1992

Alternating Hamiltonian circuits in edge-coloured bipartite graphs.
Discret. Appl. Math., 1992

1991
The embedding of partial triple systems when 4 divides lambda.
J. Comb. Theory, Ser. A, 1991

The total chromatic number of nearly complete bipartite graphs.
J. Comb. Theory, Ser. B, 1991

Outline symmetric latin squares.
Discret. Math., 1991

1990
Trees that admit 3-to-1 maps onto the circle.
J. Graph Theory, 1990

On the maximum number of pairwise compatible euler cycles.
J. Graph Theory, 1990

The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small.
J. Comb. Theory, Ser. B, 1990

A total-chromatic number analogue of plantholt's theorem.
Discret. Math., 1990

1989
On the Delta-subgraph of graphs which are critical with respect to the chromatic index.
J. Comb. Theory, Ser. B, 1989

A Delta-subgraph condition for a graph to be class 1.
J. Comb. Theory, Ser. B, 1989

Two conjectures on edge-colouring.
Discret. Math., 1989

1-factorizing regular graphs of high degree - an improved bound.
Discret. Math., 1989

1988
Reverse class critical multigraphs.
Discret. Math., 1988

1987
A note concerning the chromatic index of multigraphs.
J. Graph Theory, 1987

Recent progress on edge-colouring graphs.
Discret. Math., 1987

The edge-chromatic class of regular graphs of degree 4 and their complements.
Discret. Appl. Math., 1987

1986
Critical star multigraphs.
Graphs Comb., 1986

Hamiltonian decompositions of complete regular s-partite graphs.
Discret. Math., 1986

1985
Factorizations of regular graphs of high degree.
J. Graph Theory, 1985

1984
The chromatic index of graphs of even order with many edges.
J. Graph Theory, 1984

Hamiltonian decompositions of complete graphs.
J. Comb. Theory, Ser. B, 1984

1983
Pairings from Down-Sets and Up-Sets in Distributive Lattices.
J. Comb. Theory, Ser. A, 1983

Doubly diagonal orthogonal latin squares.
Discret. Math., 1983

1982
Canonical edge-colourings of locally finite graphs.
Comb., 1982

1980
Embedding Incomplete Latin Squares in Latin Squares Whose Diagonal is Almost Completely Prescribed.
Eur. J. Comb., 1980

Generalized latin rectangles II: Embedding.
Discret. Math., 1980

Generalized Latin rectangles I: Construction and decomposition.
Discret. Math., 1980

1979
Some Results on Sperner Families.
J. Comb. Theory, Ser. A, 1979

1978
Further remarks on partitioning the edges of a graph.
J. Comb. Theory, Ser. B, 1978

Partitioning the edges of a graph.
J. Comb. Theory, Ser. B, 1978

1976
Further results concerning p-quasigroups and complete graph decompositions.
Discret. Math., 1976

1975
On the Spectra of Certain Types of Latin Square.
J. Comb. Theory, Ser. A, 1975

Remarks on Sade's Disproof of the Euler Conjecture with an Application to Latin Squares Orthogonal to Their Transpose.
J. Comb. Theory, Ser. A, 1975

Embedding incomplete double diagonal Latin squares.
Discret. Math., 1975

1974
How to colour the lines of a bigraph.
Networks, 1974

Existence Theorems for Sperner Families.
J. Comb. Theory, Ser. A, 1974

A further construction of double diagonal orthogonal latin squares.
Discret. Math., 1974

1973
Embedding an Incomplete Diagonal Latin Square in a Complete Diagonal Latin Square.
J. Comb. Theory, Ser. A, 1973

1972
A Simplification of Moore's Proof of the Existence of Steiner Triple Systems.
J. Comb. Theory, Ser. A, 1972


  Loading...