Amanda G. Chetwynd

According to our database, Amanda G. Chetwynd authored at least 23 papers between 1983 and 1997.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

1997

Avoiding partial Latin squares and intricacy.

Amanda G. Chetwynd, Susan J. Rhodes

Discret. Math., 1997

1996

An Improvement of Hind's Upper Bound on the Total Chromatic Number.

Amanda G. Chetwynd, Roland Häggkvist

Comb. Probab. Comput., 1996

Specification and Verification of Real-Time Properties Using LOTOS and SQTL.

Abderrahmane Lakas, Gordon S. Blair, Amanda G. Chetwynd

Proceedings of the 8th International Workshop on Software Specification and Design, 1996

Costing - Extending the Locative Logic Model of Networks.

Neil Barnes, Gordon S. Blair, Abderrahmane Lakas, Amanda G. Chetwynd

Proceedings of the Eighth Euromicro Workshop on Real-Time Systems, 1996

1995

Chessboard squares.

Amanda G. Chetwynd, Susan J. Rhodes

Discret. Math., 1995

Formal description of distributed multimedia systems: an assessment of potential techniques.

Howard Bowman, Gordon S. Blair, Lynne Blair, Amanda G. Chetwynd

Comput. Commun., 1995

1994

A Formal Description Technique Supporting Expression of Quality of Service and Media Synchronisation.

Howard Bowman, Lynne Blair, Gordon S. Blair, Amanda G. Chetwynd

Proceedings of the Multimedia Transport and Teleservices, 1994

1993

Time Versus Abstraction in Formal Description.

Howard Bowman, Gordon S. Blair, Lynne Blair, Amanda G. Chetwynd

Proceedings of the Formal Description Techniques, VI, Proceedings of the IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques, 1993

1992

Some upper bounds on the total and list chromatic numbers of multigraphs.

Roland Häggkvist, Amanda G. Chetwynd

J. Graph Theory, 1992

Alternating hamiltonian cycles in two colored complete bipartite graphs.

Amanda G. Chetwynd, Anthony J. W. Hilton

J. Graph Theory, 1992

Introduction to LOTOS through a worked example.

Lynne Drayton, Amanda G. Chetwynd, Gordon S. Blair

Comput. Commun., 1992

1991

Outline symmetric latin squares.

Amanda G. Chetwynd, Anthony J. W. Hilton

Discret. Math., 1991

1990

The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small.

Amanda G. Chetwynd, Anthony J. W. Hilton

J. Comb. Theory, Ser. B, 1990

1989

A note on list-colorings.

Amanda G. Chetwynd, Roland Häggkvist

J. Graph Theory, 1989

On the Delta-subgraph of graphs which are critical with respect to the chromatic index.

Amanda G. Chetwynd, Anthony J. W. Hilton, Dean G. Hoffman

J. Comb. Theory, Ser. B, 1989

A Delta-subgraph condition for a graph to be class 1.

Amanda G. Chetwynd, Anthony J. W. Hilton

J. Comb. Theory, Ser. B, 1989

1-factorizing regular graphs of high degree - an improved bound.

Amanda G. Chetwynd, Anthony J. W. Hilton

Discret. Math., 1989

1987

Decomposition of snarks.

Peter J. Cameron, Amanda G. Chetwynd, John J. Watkins

J. Graph Theory, 1987

The edge-chromatic class of regular graphs of degree 4 and their complements.

Amanda G. Chetwynd, Anthony J. W. Hilton

Discret. Appl. Math., 1987

1986

Critical star multigraphs.

Amanda G. Chetwynd, Anthony J. W. Hilton

Graphs Comb., 1986

1984

The chromatic index of graphs of even order with many edges.

Amanda G. Chetwynd, Anthony J. W. Hilton

J. Graph Theory, 1984

1983

The rise and fall of the critical graph conjecture.

Amanda G. Chetwynd, Robin J. Wilson

J. Graph Theory, 1983

Chromatic index critical graphs of order 9.

Amanda G. Chetwynd, H. P. Yap

Discret. Math., 1983