Ronald D. Dutton - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 40 from 40

2019

A new graph coloring schemeRonald D. Dutton, Robert C. Brigham. bullica, 86:19-33, 2019. [doi]

2017

Color Stable GraphsRonald D. Dutton, Robert C. Brigham. bullica, 79:66-81, 2017. [doi]

2013

Edge dominating sets and vertex coversRonald D. Dutton, William Klostermeyer. dmgt, 33(2):437-456, 2013. [doi]

2011

Global Domination and Packing NumbersRonald D. Dutton. arscom, 101:489-501, 2011.

Global secure sets of grid-like graphsYiu Yu Ho, Ronald D. Dutton. DAM, 159(6):490-496, 2011. [doi]

2009

Powerful alliances in graphsRobert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi. DM, 309(8):2140-2147, 2009. [doi]

On a graph s security numberRonald D. Dutton. DM, 309(13):4443-4447, 2009. [doi]

On global domination critical graphsRonald D. Dutton, Robert C. Brigham. DM, 309(19):5894-5897, 2009. [doi]

Partitioning a graph into alliance free setsKhurram Shafique, Ronald D. Dutton. DM, 309(10):3102-3105, 2009. [doi]

2008

Bounds on Powerful Alliance NumbersRobert C. Brigham, Ronald D. Dutton. arscom, 88, 2008.

Bounds on a graph s security numberRonald D. Dutton, Robert Lee, Robert C. Brigham. DAM, 156(5):695-704, 2008. [doi]

2007

Security in graphsRobert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi. DAM, 155(13):1708-1714, 2007. [doi]

2005

On the dimension of treesRobert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang. DM, 294(3):279-283, 2005. [doi]

2003

Edge-recognizable domination numbersRonald D. Dutton, Robert C. Brigham, Chao Gui. DM, 272(1):47-51, 2003. [doi]

2001

Full domination in graphsRobert C. Brigham, Gary Chartrand, Ronald D. Dutton, Ping Zhang 0004. dmgt, 21(1):43-62, 2001. [doi]

2000

An extremal bandwidth problem for bipartite graphsRobert C. Brigham, Julie R. Carrington, Ronald D. Dutton, Joseph Fiedler, Richard P. Vitray. jgt, 35(4):278-289, 2000. [doi]

1999

An Equation Involving the Neighborhood (Two-Step) and Line GraphsMary M. Miller, Robert C. Brigham, Ronald D. Dutton. arscom, 52, 1999.

1998

Inversions in k-sorted PermutationsRonald D. Dutton. DAM, 87(1-3):49-56, 1998. [doi]

1995

On the radius and diameter of the clique graphRonald D. Dutton, Robert C. Brigham. DM, 147(1-3):293-295, 1995. [doi]

1993

Weak-Heap SortRonald D. Dutton. bit, 33(3):372-381, 1993.

Extremal Graphs Domination Insensitive to the Removal of ::::k:::: EdgesTeresa W. Haynes, Robert C. Brigham, Ronald D. Dutton. DAM, 44(1-3):295-304, 1993. [doi]

1991

A compilation of relations between graph invariants - supplement IRobert C. Brigham, Ronald D. Dutton. networks, 21(4):421-455, 1991. [doi]

Edges in graphs with large girthRonald D. Dutton, Robert C. Brigham. gc, 7(4):315-321, 1991. [doi]

1990

Factor domination in graphsRobert C. Brigham, Ronald D. Dutton. DM, 86(1-3):127-136, 1990. [doi]

1989

INGRID: A Graph Invariant ManipulatorRonald D. Dutton, Robert C. Brigham, Fernando Gomez. JSC, 7(2):163-177, 1989.

On the size of graphs of a given bandwidthRonald D. Dutton, Robert C. Brigham. DM, 76(3):191-195, 1989. [doi]

1988

Vertex domination-critical graphsRobert C. Brigham, Phyllis Z. Chinn, Ronald D. Dutton. networks, 18(3):173-179, 1988. [doi]

An extremal problem for edge domination insensitive graphsRonald D. Dutton, Robert C. Brigham. DAM, 20(2):113-125, 1988. [doi]

1986

Computationally Efficient Bounds for the Catalan NumbersRonald D. Dutton, Robert C. Brigham. ejc, 7(3):211-213, 1986. [doi]

Extension of a clique cover result to uniform hypergraphsA. Patricia Shelton, Ronald D. Dutton, Robert C. Brigham. DM, 59(1-2):199-201, 1986. [doi]

1985

A compilation of relations between graph invariantsRobert C. Brigham, Ronald D. Dutton. networks, 15(1):73-107, 1985. [doi]

1984

Bounds on graph spectraRobert C. Brigham, Ronald D. Dutton. JCT, 37(3):228-234, 1984. [doi]

Upper bounds on the edge clique cover number of a graphRobert C. Brigham, Ronald D. Dutton. DM, 52(1):31-37, 1984. [doi]

1983

Efficiently identifying the faces of a solidRonald D. Dutton, Robert C. Brigham. cg, 7(2):143-147, 1983. [doi]

A characterization of competition graphsRonald D. Dutton, Robert C. Brigham. DAM, 6(3):315-317, 1983. [doi]

1982

Generalized ::::k::::-tuple colorings of cycles and other graphsRobert C. Brigham, Ronald D. Dutton. JCT, 32(1):90-94, 1982. [doi]

The Complexity of a Multiprocessor Task Assignment Problem without DeadlinesRonald D. Dutton, Robert C. Brigham. TCS, 17:213-216, 1982.

1981

Graphs which, with their complements, have certain clique covering numbersRobert C. Brigham, Ronald D. Dutton. DM, 34(1):1-7, 1981. [doi]

Complexity of a proposed database storage structureRobert C. Brigham, Ronald D. Dutton, James R. Driscoll. is, 6(1):47-52, 1981.

A New Graph Colouring AlgorithmRonald D. Dutton, Robert C. Brigham. cj, 24(1):85-86, 1981.

Sign in or sign up to see more results.

runs on WebDSL