default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJim A. MacDougall
Person information
- affiliation: The University of Newcastle, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j17]Ian D. Gray, Jim A. MacDougall:
Vertex-magic labeling of regular graphs: Disjoint unions and assemblages. Discret. Appl. Math. 160(7-8): 1114-1125 (2012)- 2011
- [j16]Jason S. Kimberley, Jim A. MacDougall:
All regular graphs of small odd order are vertex-magic. Australas. J Comb. 51: 175-200 (2011) - 2010
- [j15]Ian D. Gray, Jim A. MacDougall:
Vertex-magic labeling of non-regular graphs. Australas. J Comb. 46: 173-184 (2010)
2000 – 2009
- 2009
- [j14]Ian D. Gray, Jim A. MacDougall:
Vertex-magic labelings: mutations. Australas. J Comb. 45: 189-206 (2009) - [j13]Ian D. Gray, Jim A. MacDougall:
Vertex-magic labelings of regular graphs II. Discret. Math. 309(20): 5986-5999 (2009) - 2008
- [j12]Jim A. MacDougall, Walter D. Wallis:
Strong edge-magic graphs of maximum size. Discret. Math. 308(13): 2756-2763 (2008) - 2006
- [j11]Ian D. Gray, Jim A. MacDougall:
Sparse Semi-Magic Squares and Vertex-Magic Labelings. Ars Comb. 80 (2006) - [j10]Ian D. Gray, Jim A. MacDougall:
Sparse anti-magic squares and vertex-magic labelings of bipartite graphs. Discret. Math. 306(22): 2878-2892 (2006) - 2003
- [j9]Jim A. MacDougall, Walter D. Wallis:
Strong edge-magic labelling of a cycle with a chord. Australas. J Comb. 28: 245-256 (2003) - [j8]Ian D. Gray, Jim A. MacDougall, R. J. Simpson, Walter D. Wallis:
Vertex-Magic Total Labelings of Complete Bipartite Graphs. Ars Comb. 69 (2003) - [j7]Ian D. Gray, Jim A. MacDougall, John P. McSorley, Walter D. Wallis:
Vertex-magic labeling of trees and forests. Discret. Math. 261(1-3): 285-298 (2003) - [j6]Martin Baca, François Bertault, James Arthur MacDougall, Mirka Miller, Rinovia Simanjuntak, Slamin:
Vertex-antimagic total labelings of graphs. Discuss. Math. Graph Theory 23(1): 67-83 (2003) - [j5]Mike Daven, Jim A. MacDougall, C. A. Rodger:
Maximal sets of hamilton cycles in complete multipartite graphs. J. Graph Theory 43(1): 49-66 (2003) - 2002
- [j4]Roger B. Eggleton, James Arthur MacDougall:
Minimally triangle-saturated graphs: adjoining a single vertex. Australas. J Comb. 25: 263-278 (2002) - 2000
- [j3]Martin Baca, Jim A. MacDougall, Mirka Miller, Slamin, Walter D. Wallis:
Survey of certain valuations of graphs. Discuss. Math. Graph Theory 20(2): 219-229 (2000)
1990 – 1999
- 1999
- [j2]James Arthur MacDougall, Gary L. Mullen:
A note on BIB designs with nested rows and columns. Australas. J Comb. 20: 257-260 (1999) - 1990
- [j1]Roger B. Eggleton, Latif Al-Hakim, James Arthur MacDougall:
Braced edges in plane triangulations. Australas. J Comb. 2: 121-134 (1990)
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-04-24 22:56 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:
