Amanda G. Chetwynd

Publication Activity (10 Years)

Years Active: 1983-1997
Publications (10 Years): 0

Publications

Amanda G. Chetwynd, Susan J. Rhodes
Avoiding partial Latin squares and intricacy. Discret. Math. 177 (1-3) (1997)
Abderrahmane Lakas, Gordon S. Blair, Amanda G. Chetwynd
Specification and Verification of Real-Time Properties Using LOTOS and SQTL. IWSSD (1996)
Neil Barnes, Gordon S. Blair, Abderrahmane Lakas, Amanda G. Chetwynd
Costing - Extending the Locative Logic Model of Networks. RTS (1996)
Amanda G. Chetwynd, Roland Häggkvist
An Improvement of Hind's Upper Bound on the Total Chromatic Number. Comb. Probab. Comput. 5 (1996)
Amanda G. Chetwynd, Susan J. Rhodes
Chessboard squares. Discret. Math. 141 (1-3) (1995)
Howard Bowman, Gordon S. Blair, Lynne Blair, Amanda G. Chetwynd
Formal description of distributed multimedia systems: an assessment of potential techniques. Comput. Commun. 18 (12) (1995)
Howard Bowman, Lynne Blair, Gordon S. Blair, Amanda G. Chetwynd
A Formal Description Technique Supporting Expression of Quality of Service and Media Synchronisation. COST 237 Workshop (1994)
Howard Bowman, Gordon S. Blair, Lynne Blair, Amanda G. Chetwynd
Time Versus Abstraction in Formal Description. FORTE (1993)
Lynne Drayton, Amanda G. Chetwynd, Gordon S. Blair
Introduction to LOTOS through a worked example. Comput. Commun. 15 (2) (1992)
Amanda G. Chetwynd, Anthony J. W. Hilton
Alternating hamiltonian cycles in two colored complete bipartite graphs. J. Graph Theory 16 (2) (1992)
Roland Häggkvist, Amanda G. Chetwynd
Some upper bounds on the total and list chromatic numbers of multigraphs. J. Graph Theory 16 (5) (1992)
Amanda G. Chetwynd, Anthony J. W. Hilton
Outline symmetric latin squares. Discret. Math. 97 (1-3) (1991)
Amanda G. Chetwynd, Anthony J. W. Hilton
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 48 (1) (1990)
Amanda G. Chetwynd, Anthony J. W. Hilton
A Delta-subgraph condition for a graph to be class 1. J. Comb. Theory, Ser. B 46 (1) (1989)
Amanda G. Chetwynd, Anthony J. W. Hilton, Dean G. Hoffman
On the Delta-subgraph of graphs which are critical with respect to the chromatic index. J. Comb. Theory, Ser. B 46 (2) (1989)
Amanda G. Chetwynd, Anthony J. W. Hilton
1-factorizing regular graphs of high degree - an improved bound. Discret. Math. 75 (1-3) (1989)
Amanda G. Chetwynd, Roland Häggkvist
A note on list-colorings. J. Graph Theory 13 (1) (1989)
Amanda G. Chetwynd, Anthony J. W. Hilton
The edge-chromatic class of regular graphs of degree 4 and their complements. Discret. Appl. Math. 16 (2) (1987)
Peter J. Cameron, Amanda G. Chetwynd, John J. Watkins
Decomposition of snarks. J. Graph Theory 11 (1) (1987)
Amanda G. Chetwynd, Anthony J. W. Hilton
Critical star multigraphs. Graphs Comb. 2 (1) (1986)
Amanda G. Chetwynd, Anthony J. W. Hilton
The chromatic index of graphs of even order with many edges. J. Graph Theory 8 (4) (1984)
Amanda G. Chetwynd, Robin J. Wilson
The rise and fall of the critical graph conjecture. J. Graph Theory 7 (2) (1983)
Amanda G. Chetwynd, H. P. Yap
Chromatic index critical graphs of order 9. Discret. Math. 47 (1983)