default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmanda G. Chetwynd
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
[j19]Amanda G. Chetwynd
, Susan J. Rhodes:
Avoiding partial Latin squares and intricacy. Discret. Math. 177(1-3): 17-32 (1997)- 1996
- [j18]Amanda G. Chetwynd, Roland Häggkvist:
An Improvement of Hind's Upper Bound on the Total Chromatic Number. Comb. Probab. Comput. 5: 94-104 (1996) - [c4]Neil Barnes, Gordon S. Blair, Abderrahmane Lakas, Amanda G. Chetwynd:
Costing - Extending the Locative Logic Model of Networks. RTS 1996: 89-95 - [c3]Abderrahmane Lakas, Gordon S. Blair, Amanda G. Chetwynd:
Specification and Verification of Real-Time Properties Using LOTOS and SQTL. IWSSD 1996: 75-84 - 1995
- [j17]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): 964-977 (1995) - [j16]Amanda G. Chetwynd, Susan J. Rhodes:
Chessboard squares. Discret. Math. 141(1-3): 47-59 (1995) - 1994
- [c2]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: 145-167 - 1993
- [c1]Howard Bowman, Gordon S. Blair, Lynne Blair, Amanda G. Chetwynd:
Time Versus Abstraction in Formal Description. FORTE 1993: 467-482 - 1992
- [j15]Lynne Drayton, Amanda G. Chetwynd, Gordon S. Blair:
Introduction to LOTOS through a worked example. Comput. Commun. 15(2): 70-85 (1992) - [j14]Amanda G. Chetwynd, Anthony J. W. Hilton:
Alternating hamiltonian cycles in two colored complete bipartite graphs. J. Graph Theory 16(2): 153-158 (1992) - [j13]Roland Häggkvist, Amanda G. Chetwynd:
Some upper bounds on the total and list chromatic numbers of multigraphs. J. Graph Theory 16(5): 503-516 (1992) - 1991
- [j12]Amanda G. Chetwynd, Anthony J. W. Hilton:
Outline symmetric latin squares. Discret. Math. 97(1-3): 101-117 (1991) - 1990
- [j11]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 B 48(1): 45-66 (1990)
1980 – 1989
- 1989
- [j10]Amanda G. Chetwynd, Anthony J. W. Hilton:
1-factorizing regular graphs of high degree - an improved bound. Discret. Math. 75(1-3): 103-112 (1989) - [j9]Amanda G. Chetwynd, Anthony J. W. Hilton:
A Delta-subgraph condition for a graph to be class 1. J. Comb. Theory B 46(1): 37-45 (1989) - [j8]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 B 46(2): 240-245 (1989) - [j7]Amanda G. Chetwynd, Roland Häggkvist:
A note on list-colorings. J. Graph Theory 13(1): 87-95 (1989) - 1987
- [j6]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): 125-134 (1987) - [j5]Peter J. Cameron, Amanda G. Chetwynd, John J. Watkins:
Decomposition of snarks. J. Graph Theory 11(1): 13-19 (1987) - 1986
- [j4]Amanda G. Chetwynd, Anthony J. W. Hilton:
Critical star multigraphs. Graphs Comb. 2(1): 209-221 (1986) - 1984
- [j3]Amanda G. Chetwynd, Anthony J. W. Hilton:
The chromatic index of graphs of even order with many edges. J. Graph Theory 8(4): 463-470 (1984) - 1983
- [j2]Amanda G. Chetwynd, H. P. Yap:
Chromatic index critical graphs of order 9. Discret. Math. 47: 23-33 (1983) - [j1]Amanda G. Chetwynd, Robin J. Wilson:
The rise and fall of the critical graph conjecture. J. Graph Theory 7(2): 153-157 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
