Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Ronald D. Dutton - MaRDI portal

Ronald D. Dutton

From MaRDI portal
(Redirected from Person:624144)
Person:792342

Available identifiers

zbMath Open dutton.ronald-dMaRDI QIDQ792342

List of research outcomes





PublicationDate of PublicationType
On 4-colorable robust critical graphs2022-03-09Paper
Global Domination2021-12-15Paper
https://portal.mardi4nfdi.de/entity/Q51330582020-11-12Paper
https://portal.mardi4nfdi.de/entity/Q51198312020-09-01Paper
https://portal.mardi4nfdi.de/entity/Q52359592019-10-14Paper
https://portal.mardi4nfdi.de/entity/Q45662412018-06-14Paper
https://portal.mardi4nfdi.de/entity/Q29609412017-02-17Paper
https://portal.mardi4nfdi.de/entity/Q29401272015-01-26Paper
https://portal.mardi4nfdi.de/entity/Q28782212014-08-28Paper
Edge dominating sets and vertex covers2013-11-11Paper
https://portal.mardi4nfdi.de/entity/Q28396392013-07-12Paper
https://portal.mardi4nfdi.de/entity/Q29185732012-10-08Paper
https://portal.mardi4nfdi.de/entity/Q31131952012-02-08Paper
Global secure sets of grid-like graphs2011-03-10Paper
Rooted secure sets of trees2011-02-08Paper
https://portal.mardi4nfdi.de/entity/Q30703142011-02-02Paper
On global domination critical graphs2009-12-15Paper
On a graph's security number2009-12-10Paper
Partitioning a graph into alliance free sets2009-06-23Paper
Powerful alliances in graphs2009-06-19Paper
https://portal.mardi4nfdi.de/entity/Q36205422009-04-14Paper
https://portal.mardi4nfdi.de/entity/Q36160162009-03-24Paper
https://portal.mardi4nfdi.de/entity/Q54432002008-02-20Paper
Security in graphs2007-09-18Paper
https://portal.mardi4nfdi.de/entity/Q34295152007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q34295522007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q34239902007-02-15Paper
https://portal.mardi4nfdi.de/entity/Q54888952006-09-25Paper
https://portal.mardi4nfdi.de/entity/Q54883682006-09-14Paper
On the dimension of trees2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q46779312005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46779722005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q48262752004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q44726922004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44605552004-05-18Paper
Edge-recognizable domination numbers.2003-12-04Paper
https://portal.mardi4nfdi.de/entity/Q44057762003-11-20Paper
https://portal.mardi4nfdi.de/entity/Q44057942003-10-30Paper
Resolving domination in graphs2003-04-23Paper
https://portal.mardi4nfdi.de/entity/Q45292482002-11-06Paper
https://portal.mardi4nfdi.de/entity/Q45293052002-10-10Paper
https://portal.mardi4nfdi.de/entity/Q27443752002-05-02Paper
Full domination in graphs2002-03-24Paper
https://portal.mardi4nfdi.de/entity/Q27609862001-12-17Paper
An extremal bandwidth problem for bipartite graphs2001-05-10Paper
https://portal.mardi4nfdi.de/entity/Q49435232000-10-18Paper
https://portal.mardi4nfdi.de/entity/Q44892232000-07-09Paper
https://portal.mardi4nfdi.de/entity/Q42430492000-03-13Paper
Inversions in \(k\)-sorted permutations1999-03-07Paper
https://portal.mardi4nfdi.de/entity/Q38384121999-01-11Paper
https://portal.mardi4nfdi.de/entity/Q43932991998-11-15Paper
https://portal.mardi4nfdi.de/entity/Q38381811998-08-09Paper
https://portal.mardi4nfdi.de/entity/Q43932751998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43781811998-03-30Paper
https://portal.mardi4nfdi.de/entity/Q43373661997-11-10Paper
https://portal.mardi4nfdi.de/entity/Q27857131997-07-20Paper
https://portal.mardi4nfdi.de/entity/Q52839831997-02-04Paper
https://portal.mardi4nfdi.de/entity/Q48805201996-06-09Paper
https://portal.mardi4nfdi.de/entity/Q48634171996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48736811996-04-17Paper
On the radius and diameter of the clique graph1996-03-24Paper
Weak-heap sort1995-11-14Paper
Changing and unchanging of the radius of a graph1995-06-12Paper
https://portal.mardi4nfdi.de/entity/Q43019141994-11-21Paper
https://portal.mardi4nfdi.de/entity/Q31397261994-06-12Paper
https://portal.mardi4nfdi.de/entity/Q40392571994-06-09Paper
Extremal graphs domination insensitive to the removal of \(k\) edges1993-11-28Paper
https://portal.mardi4nfdi.de/entity/Q40285021993-03-28Paper
Theg-network and its inherent fault tolerant properties1992-09-27Paper
Edges in graphs with large girth1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39845301992-06-27Paper
A compilation of relations between graph invariants—supplement I1992-06-25Paper
Factor domination in graphs1990-01-01Paper
BOUNDS ON THE DOMINATION NUMBER OF A GRAPH1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34721281990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34721291990-01-01Paper
INGRID: A graph invariant manipulator1989-01-01Paper
On the size of graphs of a given bandwidth1989-01-01Paper
An extremal problem for edge domination insensitive graphs1988-01-01Paper
Vertex domination-critical graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38295721988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47298191988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34721231987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38031571987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38206421987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47298151987-01-01Paper
Extension of a clique cover result to uniform hypergraphs1986-01-01Paper
Computationally efficient bounds for the Catalan numbers1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37623581986-01-01Paper
A compilation of relations between graph invariants1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37357291985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37911681985-01-01Paper
Bounds on graph spectra1984-01-01Paper
Upper bounds on the edge clique cover number of a graph1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36952921984-01-01Paper
A characterization of competition graphs1983-01-01Paper
On clique covers and independence numbers of graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33138901983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33187791983-01-01Paper
Generalized k-tuple colorings of cycles and other graphs1982-01-01Paper
The complexity of a multiprocessor task assignment problem without deadlines1982-01-01Paper
Graphs which, with their complements, have certain clique covering numbers1981-01-01Paper
A new graph colouring algorithm1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39015521980-01-01Paper

Research outcomes over time

This page was built for person: Ronald D. Dutton