Anthony J. W. Hilton
Anthony J. W. Hilton has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Dudley Stark
SCHOOL OF MATHEMATICAL SCIENCES; QUEEN MARY UNIVERSITY OF LONDON; MILE END ROAD, LONDON E1 4NS; ENGLAND; UNITED KINGDOM
1 shared publication - Jenő Lehel
The University of Memphis
1 shared publication - John Baptist Gauci
Department of Mathematics, University of Malta, Msida, Malta
1 shared publication - Mathew Cropper
Department of Mathematics and Statistics, Eastern Kentucky University, Richmond, KY 40475-3133
1 shared publication - Peter Johnson
Auburn University
1 shared publication
Latest Publications
- 11 January 2013
- Published by Wiley in Journal of Graph Theory
- Vol. 74 (3) , 275-308
Wiggles and Finitely Discontinuousk-to-1 Functions Between Graphs
- 11 January 2013
- Published by Wiley in Journal of Graph Theory
- Vol. 74 (3) , 275-308
Wiggles and Finitely Discontinuousk-to-1 Functions Between Graphs
- 21 July 2010
- Published by Wiley in Journal of Graph Theory
- Vol. 65 (1) , 16-34
List multicoloring problems involving the k‐fold Hall numbers
We show that the four‐cycle has a k‐fold list coloring if the lists of colors available at the vertices satisfy the necessary Hall's condition, and if each list has length at least ⌈5k/3⌉; furthermore, the same is not true with shorter list lengths. In terms of h(k)(G), the k ‐fold Hall number of a graph G, this result is stated as h(k)(C4)=2k−⌊k/3⌋. For longer cycles it is known that h(k)(Cn)=2k, for n odd, and 2k−⌊k/(n−1)⌋≤h(k)(Cn)≤2k, for n even. Here we show the lower bound for n even, and conjecture that this is the right value (just as for C4). We prove that if G is the diamond (a four‐cycle with a diagonal), then h(k)(G)=2k. Combining these results with those published earlier we obtain a characterization of graphs G with h(k)(G)=k. As a tool in the proofs we obtain and apply an elementary generalization of the classical Hall–Rado–Halmos–Vaughan theorem on pairwise disjoint subset representatives with prescribed cardinalities. © 2009 Wiley Periodicals, Inc. J Graph Theory 65: 16–34, 2010.
- 21 July 2010
- Published by Wiley in Journal of Graph Theory
- Vol. 65 (1) , 16-34
List multicoloring problems involving the k‐fold Hall numbers
We show that the four‐cycle has a k‐fold list coloring if the lists of colors available at the vertices satisfy the necessary Hall's condition, and if each list has length at least ⌈5k/3⌉; furthermore, the same is not true with shorter list lengths. In terms of h(k)(G), the k ‐fold Hall number of a graph G, this result is stated as h(k)(C4)=2k−⌊k/3⌋. For longer cycles it is known that h(k)(Cn)=2k, for n odd, and 2k−⌊k/(n−1)⌋≤h(k)(Cn)≤2k, for n even. Here we show the lower bound for n even, and conjecture that this is the right value (just as for C4). We prove that if G is the diamond (a four‐cycle with a diagonal), then h(k)(G)=2k. Combining these results with those published earlier we obtain a characterization of graphs G with h(k)(G)=k. As a tool in the proofs we obtain and apply an elementary generalization of the classical Hall–Rado–Halmos–Vaughan theorem on pairwise disjoint subset representatives with prescribed cardinalities. © 2009 Wiley Periodicals, Inc. J Graph Theory 65: 16–34, 2010.
- 20 February 2009
- Published by Wiley in Journal of Graph Theory
- Vol. 60 (4) , 257-268
On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
- 20 February 2009
- Published by Wiley in Journal of Graph Theory
- Vol. 60 (4) , 257-268
On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph