default search action
Ronald D. Dutton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j41]Ronald D. Dutton, Robert C. Brigham:
A new graph coloring scheme. Bull. ICA 86: 19-33 (2019) - 2017
- [j40]Ronald D. Dutton, Robert C. Brigham:
Color Stable Graphs. Bull. ICA 79: 66-81 (2017) - 2013
- [j39]Ronald D. Dutton, William Klostermeyer:
Edge dominating sets and vertex covers. Discuss. Math. Graph Theory 33(2): 437-456 (2013) - 2011
- [j38]Ronald D. Dutton:
Global Domination and Packing Numbers. Ars Comb. 101: 489-501 (2011) - [j37]Yiu Yu Ho, Ronald D. Dutton:
Global secure sets of grid-like graphs. Discret. Appl. Math. 159(6): 490-496 (2011)
2000 – 2009
- 2009
- [j36]Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi:
Powerful alliances in graphs. Discret. Math. 309(8): 2140-2147 (2009) - [j35]Khurram Shafique, Ronald D. Dutton:
Partitioning a graph into alliance free sets. Discret. Math. 309(10): 3102-3105 (2009) - [j34]Ronald D. Dutton:
On a graph's security number. Discret. Math. 309(13): 4443-4447 (2009) - [j33]Ronald D. Dutton, Robert C. Brigham:
On global domination critical graphs. Discret. Math. 309(19): 5894-5897 (2009) - 2008
- [j32]Robert C. Brigham, Ronald D. Dutton:
Bounds on Powerful Alliance Numbers. Ars Comb. 88 (2008) - [j31]Ronald D. Dutton, Robert Lee, Robert C. Brigham:
Bounds on a graph's security number. Discret. Appl. Math. 156(5): 695-704 (2008) - 2007
- [j30]Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi:
Security in graphs. Discret. Appl. Math. 155(13): 1708-1714 (2007) - 2005
- [j29]Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang:
On the dimension of trees. Discret. Math. 294(3): 279-283 (2005) - 2003
- [j28]Ronald D. Dutton, Robert C. Brigham, Chao Gui:
Edge-recognizable domination numbers. Discret. Math. 272(1): 47-51 (2003) - 2001
- [j27]Robert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang:
Full domination in graphs. Discuss. Math. Graph Theory 21(1): 43-62 (2001) - 2000
- [j26]Robert C. Brigham, Julie R. Carrington, Ronald D. Dutton, Joseph Fiedler, Richard P. Vitray:
An extremal bandwidth problem for bipartite graphs. J. Graph Theory 35(4): 278-289 (2000)
1990 – 1999
- 1999
- [j25]Mary M. Miller, Robert C. Brigham, Ronald D. Dutton:
An Equation Involving the Neighborhood (Two-Step) and Line Graphs. Ars Comb. 52 (1999) - 1998
- [j24]Ronald D. Dutton:
Inversions in k-sorted Permutations. Discret. Appl. Math. 87(1-3): 49-56 (1998) - 1995
- [j23]Ronald D. Dutton, Robert C. Brigham:
On the radius and diameter of the clique graph. Discret. Math. 147(1-3): 293-295 (1995) - 1993
- [j22]Ronald D. Dutton:
Weak-Heap Sort. BIT 33(3): 372-381 (1993) - [j21]Teresa W. Haynes, Robert C. Brigham, Ronald D. Dutton:
Extremal Graphs Domination Insensitive to the Removal of k Edges. Discret. Appl. Math. 44(1-3): 295-304 (1993) - 1991
- [j20]Ronald D. Dutton, Robert C. Brigham:
Edges in graphs with large girth. Graphs Comb. 7(4): 315-321 (1991) - [j19]Robert C. Brigham, Ronald D. Dutton:
A compilation of relations between graph invariants - supplement I. Networks 21(4): 421-455 (1991) - 1990
- [j18]Robert C. Brigham, Ronald D. Dutton:
Factor domination in graphs. Discret. Math. 86(1-3): 127-136 (1990)
1980 – 1989
- 1989
- [j17]Ronald D. Dutton, Robert C. Brigham:
On the size of graphs of a given bandwidth. Discret. Math. 76(3): 191-195 (1989) - [j16]Ronald D. Dutton, Robert C. Brigham, Fernando Gomez:
INGRID: A Graph Invariant Manipulator. J. Symb. Comput. 7(2): 163-177 (1989) - 1988
- [j15]Ronald D. Dutton, Robert C. Brigham:
An extremal problem for edge domination insensitive graphs. Discret. Appl. Math. 20(2): 113-125 (1988) - [j14]Robert C. Brigham, Phyllis Z. Chinn, Ronald D. Dutton:
Vertex domination-critical graphs. Networks 18(3): 173-179 (1988) - 1986
- [j13]A. Patricia Shelton, Ronald D. Dutton, Robert C. Brigham:
Extension of a clique cover result to uniform hypergraphs. Discret. Math. 59(1-2): 199-201 (1986) - [j12]Ronald D. Dutton, Robert C. Brigham:
Computationally Efficient Bounds for the Catalan Numbers. Eur. J. Comb. 7(3): 211-213 (1986) - 1985
- [j11]Robert C. Brigham, Ronald D. Dutton:
A compilation of relations between graph invariants. Networks 15(1): 73-107 (1985) - 1984
- [j10]Robert C. Brigham, Ronald D. Dutton:
Upper bounds on the edge clique cover number of a graph. Discret. Math. 52(1): 31-37 (1984) - [j9]Robert C. Brigham, Ronald D. Dutton:
Bounds on graph spectra. J. Comb. Theory B 37(3): 228-234 (1984) - 1983
- [j8]Ronald D. Dutton, Robert C. Brigham:
Efficiently identifying the faces of a solid. Comput. Graph. 7(2): 143-147 (1983) - [j7]Ronald D. Dutton, Robert C. Brigham:
A characterization of competition graphs. Discret. Appl. Math. 6(3): 315-317 (1983) - [j6]Robert C. Brigham, Ronald D. Dutton:
On clique covers and independence numbers of graphs. Discret. Math. 44(2): 139-144 (1983) - 1982
- [j5]Robert C. Brigham, Ronald D. Dutton:
Generalized k-tuple colorings of cycles and other graphs. J. Comb. Theory B 32(1): 90-94 (1982) - [j4]Ronald D. Dutton, Robert C. Brigham:
The Complexity of a Multiprocessor Task Assignment Problem without Deadlines. Theor. Comput. Sci. 17: 213-216 (1982) - 1981
- [j3]Ronald D. Dutton, Robert C. Brigham:
A New Graph Colouring Algorithm. Comput. J. 24(1): 85-86 (1981) - [j2]Robert C. Brigham, Ronald D. Dutton:
Graphs which, with their complements, have certain clique covering numbers. Discret. Math. 34(1): 1-7 (1981) - [j1]Robert C. Brigham, Ronald D. Dutton, James R. Driscoll:
Complexity of a proposed database storage structure. Inf. Syst. 6(1): 47-52 (1981)
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:26 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: