Amanda G. Chetwynd

Orcid: 0000-0002-7659-3231

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

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

Timeline

1984
1986
1988
1990
1992
1994
1996
0
1
2
3
4
5
1
1
2
3
1
1
4
2
1
1
2
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

1997
Avoiding partial Latin squares and intricacy.
Discret. Math., 1997

1996
An Improvement of Hind's Upper Bound on the Total Chromatic Number.
Comb. Probab. Comput., 1996

Specification and Verification of Real-Time Properties Using LOTOS and SQTL.
Proceedings of the 8th International Workshop on Software Specification and Design, 1996

Costing - Extending the Locative Logic Model of Networks.
Proceedings of the Eighth Euromicro Workshop on Real-Time Systems, 1996

1995
Chessboard squares.
Discret. Math., 1995

Formal description of distributed multimedia systems: an assessment of potential techniques.
Comput. Commun., 1995

1994
A Formal Description Technique Supporting Expression of Quality of Service and Media Synchronisation.
Proceedings of the Multimedia Transport and Teleservices, 1994

1993
Time Versus Abstraction in Formal Description.
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.
J. Graph Theory, 1992

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

Introduction to LOTOS through a worked example.
Comput. Commun., 1992

1991
Outline symmetric latin squares.
Discret. Math., 1991

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

1989
A note on list-colorings.
J. Graph Theory, 1989

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

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

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

1987
Decomposition of snarks.
J. Graph Theory, 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

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

1983
The rise and fall of the critical graph conjecture.
J. Graph Theory, 1983

Chromatic index critical graphs of order 9.
Discret. Math., 1983


  Loading...