Anthony J. W. Hilton

From MaRDI portal
Person:590704

Available identifiers

zbMath Open hilton.anthony-j-wWikidataQ573410 ScholiaQ573410MaRDI QIDQ590704

List of research outcomes

PublicationDate of PublicationType
On completing partial Latin squares with prescribed diagonals2022-09-06Paper
Several families with incomparability and complementarity conditions2021-05-19Paper
Bounds Related to The Edge-List Chromatic and Total Chromatic Numbers of a Simple Graph2020-04-04Paper
https://portal.mardi4nfdi.de/entity/Q53770132019-05-23Paper
The simple graph threshold number $\sigma(r,s,a,t)$2019-02-14Paper
https://portal.mardi4nfdi.de/entity/Q53654172017-10-06Paper
The pseudograph \((r, s, a, t)\)-threshold number2016-06-21Paper
https://portal.mardi4nfdi.de/entity/Q27997952016-04-13Paper
Hall's Condition for Partial Latin Squares2016-04-13Paper
Hall's theorem and extending partial Latinized rectangles2014-11-28Paper
Wiggles and Finitely Discontinuousk-to-1 Functions Between Graphs2013-11-15Paper
An analogue of Ryser's Theorem for partial Sudoku squares2012-07-02Paper
https://portal.mardi4nfdi.de/entity/Q31101052012-01-26Paper
KING ARTHUR AND HIS KNIGHTS WITH TWO ROUND TABLES2011-10-11Paper
https://portal.mardi4nfdi.de/entity/Q30904712011-08-31Paper
https://portal.mardi4nfdi.de/entity/Q30156612011-07-13Paper
List multicoloring problems involving the k-fold Hall numbers2010-11-10Paper
Continuous k-to-1 functions between complete graphs whose orders are of a different parity2010-11-10Paper
https://portal.mardi4nfdi.de/entity/Q35819472010-09-02Paper
SEMIREGULAR FACTORIZATIONS OF REGULAR MULTIGRAPHS2010-08-30Paper
Degree-bounded factorizations of bipartite multigraphs and of pseudographs2010-03-29Paper
Continuous \(k\)-to-\(1\) functions between complete graphs of even order2010-03-29Paper
An application of Tutte's theorem to 1-factorization of regular graphs of high degree2009-12-15Paper
A generalization of Talbot's theorem about King Arthur and his knights of the round table2009-06-18Paper
On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph2009-06-16Paper
The \(k\)-fold list coloring of cycles with Hall's condition2009-04-14Paper
\((r,r+1)\)-factorizations of \((d,d+1)\)-graphs2008-02-14Paper
https://portal.mardi4nfdi.de/entity/Q53102302007-09-21Paper
https://portal.mardi4nfdi.de/entity/Q35940502007-08-07Paper
List multicolorings of graphs with measurable sets2007-03-20Paper
https://portal.mardi4nfdi.de/entity/Q34247822007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q54925712006-10-16Paper
Semiregular factorization of simple graphs2005-09-29Paper
https://portal.mardi4nfdi.de/entity/Q46778962005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46779882005-05-23Paper
Amalgamating infinite Latin squares2005-04-28Paper
COMPLETING AN EDGE-COLOURING OF $K_{2m}$ WITH $K_r$ AND INDEPENDENT EDGES PRECOLOURED2005-03-11Paper
Amalgamations of factorizations of complete equipartite graphs2004-08-20Paper
https://portal.mardi4nfdi.de/entity/Q44329322004-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44308862003-10-13Paper
Hamiltonian double Latin squares2003-08-20Paper
Amalgamations of connected \(k\)-factorizations.2003-08-17Paper
An algorithm for finding factorizations of complete graphs2003-06-25Paper
https://portal.mardi4nfdi.de/entity/Q27651612003-06-23Paper
The structure of totally critical graphs of odd order2003-06-09Paper
Hall parameters of complete and complete bipartite graphs2003-03-19Paper
Non-conformable subgraphs of non-conformable graphs2002-12-02Paper
SOME RESULTS ON THE OBERWOLFACH PROBLEM2002-10-22Paper
The overfull conjecture and the conformability conjecture2002-08-28Paper
https://portal.mardi4nfdi.de/entity/Q43291232002-04-29Paper
Outline and Amalgamated Triple Systems of Even Index2002-01-28Paper
Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs2002-01-08Paper
https://portal.mardi4nfdi.de/entity/Q43863022001-12-04Paper
https://portal.mardi4nfdi.de/entity/Q43863032001-12-04Paper
Aspects of edge list-colourings2001-11-28Paper
https://portal.mardi4nfdi.de/entity/Q27082502001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q27082382001-07-08Paper
Fractional latin squares, simplex algebras, and generalized quotients2001-02-12Paper
https://portal.mardi4nfdi.de/entity/Q44892032001-01-14Paper
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs2000-09-24Paper
https://portal.mardi4nfdi.de/entity/Q44874502000-09-15Paper
https://portal.mardi4nfdi.de/entity/Q49344002000-08-28Paper
A Sufficient Condition for a Graph to be the Core of a Class 2 Graph2000-08-14Paper
https://portal.mardi4nfdi.de/entity/Q44885722000-07-09Paper
The Hall number, the Hall index, and the total Hall number of a graph2000-04-10Paper
r-Regular, r-connected decompositions of complete graphs2000-01-30Paper
Totally critical even order graphs1999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q43933891998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43877511998-05-13Paper
Coloring graphs which have equibipartite complements1998-04-08Paper
https://portal.mardi4nfdi.de/entity/Q43510681998-01-12Paper
A vertex-splitting lemma, de Werra's theorem and improper list colourings1997-09-15Paper
Vertex-splitting and chromatic index critical graphs1997-08-11Paper
https://portal.mardi4nfdi.de/entity/Q43478911997-08-11Paper
Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares1997-06-09Paper
https://portal.mardi4nfdi.de/entity/Q48923261996-11-25Paper
Graphs that admit 3-to-1 or 2-to-1 maps onto the circle1996-11-24Paper
At most \(k\)-to-1 mappings between graphs. II1996-11-21Paper
https://portal.mardi4nfdi.de/entity/Q48566271996-06-05Paper
Symmetric latin square and complete graph analogues of the evans conjecture1995-09-11Paper
https://portal.mardi4nfdi.de/entity/Q42978581995-01-09Paper
INTERSECTING AND NON-UNION ANTICHAINS1994-10-05Paper
Amalgamated Factorizations of Complete Graphs1994-09-13Paper
Recent results on the total chromatic number1994-08-10Paper
https://portal.mardi4nfdi.de/entity/Q31398741994-06-12Paper
A sufficient condition for equitable edge-colourings of simple graphs1994-06-09Paper
https://portal.mardi4nfdi.de/entity/Q42945971994-05-31Paper
https://portal.mardi4nfdi.de/entity/Q31424131994-05-30Paper
https://portal.mardi4nfdi.de/entity/Q42945731994-05-17Paper
https://portal.mardi4nfdi.de/entity/Q42881601994-04-19Paper
The total chromatic number of graphs having large maximum degree1994-04-13Paper
The total chromatic number of regular graphs whose complement is bipartite1994-04-04Paper
A sufficient condition for a regular graph to be class 11994-03-24Paper
The existence ofk-to-1 continuous maps between graphs whenk is sufficiently large1993-10-13Paper
https://portal.mardi4nfdi.de/entity/Q40282891993-03-28Paper
The chromatic index of a graph whose core has maximum degree two1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40168181993-01-16Paper
Exactly k-To-1 Maps Between Graphs1993-01-16Paper
The Total Chromatic Number of Graphs of High Minimum Degree1992-09-27Paper
Alternating hamiltonian cycles in two colored complete bipartite graphs1992-09-27Paper
Outline symmetric Latin squares1992-06-28Paper
Alternating Hamiltonian circuits in edge-coloured bipartite graphs1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39870441992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39870481992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39845191992-06-27Paper
The total chromatic number of nearly complete bipartite graphs1992-06-26Paper
The embedding of partial triple systems when 4 divides \(\lambda\)1992-06-25Paper
Trees that admit 3‐to‐1 maps onto the circle1992-06-25Paper
A total-chromatic number analogue of Plantholt's theorem1990-01-01Paper
The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30353131990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32010721990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32011011990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33563171990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33609031990-01-01Paper
On the maximum number of pairwise compatible euler cycles1990-01-01Paper
On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index1989-01-01Paper
A \(\Delta\)-subgraph condition for a graph to be class 11989-01-01Paper
1-factorizing regular graphs of high degree - an improved bound1989-01-01Paper
Two conjectures on edge-colouring1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30337851989-01-01Paper
Graphs which are vertex‐critical with respect to the edge‐chromatic class1989-01-01Paper
Reverse class critical multigraphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38098151988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38206381988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38325891988-01-01Paper
The edge-chromatic class of regular graphs of degree 4 and their complements1987-01-01Paper
Recent progress on edge-colouring graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37673521987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37673531987-01-01Paper
Graphs which are vertex-critical with respect to the edge-chromatic number1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37787671987-01-01Paper
A note concerning the chromatic index of multigraphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37956951987-01-01Paper
How Intricate are (2s + 1)-Factorizations?1987-01-01Paper
Hamiltonian decompositions of complete regular s-partite graphs1986-01-01Paper
Critical star multigraphs1986-01-01Paper
A generalization of Plantholt's theorem1986-01-01Paper
THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS1986-01-01Paper
Factorizations of regular graphs of high degree1985-01-01Paper
Regular Graphs of High Degree are 1-Factorizable1985-01-01Paper
Hamiltonian decompositions of complete graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33425981984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849311984-01-01Paper
The chromatic index of graphs of even order with many edges1984-01-01Paper
Pairings from down-sets and up-sets in distributive lattices1983-01-01Paper
Doubly diagonal orthogonal Latin squares1983-01-01Paper
Thank Evans!1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36579951983-01-01Paper
Small Embeddings of Incomplete Idempotent Latin Squares1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39344391983-01-01Paper
Canonical edge-colourings of locally finite graphs1982-01-01Paper
Latin Squares with Prescribed Diagonals1982-01-01Paper
Match-Tables1982-01-01Paper
Embedding Incomplete Latin Rectangles1982-01-01Paper
A Solution to the Embedding Problem for Partial Idempotent Latin Squares1982-01-01Paper
Edge-Colouring Regular Bipartite Graphs1982-01-01Paper
On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem1981-01-01Paper
School Timetables1981-01-01Paper
Embedding incomplete Latin squares in Latin squares whose diagonal is almost completely prescribed1980-01-01Paper
Generalized latin rectangles I: Construction and decomposition1980-01-01Paper
Generalized latin rectangles. II: Embedding1980-01-01Paper
The reconstruction of latin squares with applications to school timetabling and to experimental design1980-01-01Paper
Dimension in Steiner Triple Systems1980-01-01Paper
Embedding Partial Steiner Triple Systems1980-01-01Paper
A simple proof of the Kruskal-Katona theorem and of some associated binomial inequalities1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38841181979-01-01Paper
Further remarks on partitioning the edges of a graph1978-01-01Paper
Partitioning the edges of a graph1978-01-01Paper
Some intersection and union theorems for several families of finite sets1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41827751978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41878351978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41985231978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30488551977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32052421977-01-01Paper
On the Szamkolowicz-Doyen Classification of Steiner Triple Systems1977-01-01Paper
On the Minimum Number of Sets Comparable with Some Members of a Set of Finite Sets1977-01-01Paper
An Intersection Theorem for a Collection of Families of Subsets of a Finite Set1977-01-01Paper
Definitions of criticality with respect to edge-coloring1977-01-01Paper
Further results concerning P-quasigroups and complete graph decompositions1976-01-01Paper
A THEOREM ON FINITE SETS1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41138561976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41775971976-01-01Paper
Remarks on Sade's disproof of the Euler conjecture with an application to Latin squares orthogonal to their transpose1975-01-01Paper
On the spectra of certain types of latin square1975-01-01Paper
Embedding incomplete double diagonal latin squares1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40834601975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40934661975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40972981975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40973001975-01-01Paper
Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40996771975-01-01Paper
A further construction of double diagonal orthogonal latin squares1974-01-01Paper
Existence theorems for Sperner families1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40431211974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40476131974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40560741974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40687961974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40754791974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40972991974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41018301974-01-01Paper
How to colour the lines of a bigraph1974-01-01Paper
ANALOGUES OF A THEOREM OF ERDÖS, KO, AND RADO ON A FAMILY OF FINITE SETS1974-01-01Paper
Embedding an incomplete diagonal latin square in a complete diagonal latin square1973-01-01Paper
On Double Diagonal and Cross Latin Squares1973-01-01Paper
A (<5)-Colour Theorem for Planar Graphs1973-01-01Paper
SIMULTANEOUSLY DISJOINT PAIRS OF SUBSETS OF A FINITE SET1973-01-01Paper
A simplification of Moore's proof of the existence of Steiner triple systems1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56198361971-01-01Paper
On Steiner and Similar Triple Systems.1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55796451968-01-01Paper
SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55593401967-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Anthony J. W. Hilton