Robert C. Brigham

According to our database1, Robert C. Brigham authored at least 44 papers between 1959 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
A new graph coloring scheme.
Bull. ICA, 2019

2017
Color Stable Graphs.
Bull. ICA, 2017

2009
On global domination critical graphs.
Discret. Math., 2009

Powerful alliances in graphs.
Discret. Math., 2009

2008
Bounds on a graph's security number.
Discret. Appl. Math., 2008

Bounds on Powerful Alliance Numbers.
Ars Comb., 2008

2007
Security in graphs.
Discret. Appl. Math., 2007

2005
Bicritical domination.
Discret. Math., 2005

On the dimension of trees.
Discret. Math., 2005

2004
Extremal connected graphs for independent domination number.
Discret. Math., 2004

2003
Edge-recognizable domination numbers.
Discret. Math., 2003

Change in Additive Bandwidth When an Edge is Added.
Ars Comb., 2003

Graphical Measurement.
Proceedings of the Handbook of Graph Theory., 2003

2001
Full domination in graphs.
Discuss. Math. Graph Theory, 2001

2000
An extremal bandwidth problem for bipartite graphs.
J. Graph Theory, 2000

Domination Sequences.
Ars Comb., 2000

1999
An Equation Involving the Neighborhood (Two-Step) and Line Graphs.
Ars Comb., 1999

Bipartite Graphs and Absolute Difference Tolerances.
Ars Comb., 1999

1996
Two - ø - Tolerance Competition Graphs.
Discret. Appl. Math., 1996

1995
On the radius and diameter of the clique graph.
Discret. Math., 1995

1993
Extremal Graphs Domination Insensitive to the Removal of <i>k</i> Edges.
Discret. Appl. Math., 1993

1991
A compilation of relations between graph invariants - supplement I.
Networks, 1991

Edges in graphs with large girth.
Graphs Comb., 1991

1990
Factor domination in graphs.
Discret. Math., 1990

1989
INGRID: A Graph Invariant Manipulator.
J. Symb. Comput., 1989

On the size of graphs of a given bandwidth.
Discret. Math., 1989

1988
Vertex domination-critical graphs.
Networks, 1988

An extremal problem for edge domination insensitive graphs.
Discret. Appl. Math., 1988

1986
Computationally Efficient Bounds for the Catalan Numbers.
Eur. J. Comb., 1986

Extension of a clique cover result to uniform hypergraphs.
Discret. Math., 1986

1985
A compilation of relations between graph invariants.
Networks, 1985

1984
Bounds on graph spectra.
J. Comb. Theory B, 1984

Upper bounds on the edge clique cover number of a graph.
Discret. Math., 1984

1983
On clique covers and independence numbers of graphs.
Discret. Math., 1983

A characterization of competition graphs.
Discret. Appl. Math., 1983

Efficiently identifying the faces of a solid.
Comput. Graph., 1983

1982
The Complexity of a Multiprocessor Task Assignment Problem without Deadlines.
Theor. Comput. Sci., 1982

Generalized <i>k</i>-tuple colorings of cycles and other graphs.
J. Comb. Theory B, 1982

1981
Complexity of a proposed database storage structure.
Inf. Syst., 1981

Graphs which, with their complements, have certain clique covering numbers.
Discret. Math., 1981

A New Graph Colouring Algorithm.
Comput. J., 1981

1961
Some Properties of Binary Counters with Feedback.
IRE Trans. Electron. Comput., 1961

Generalized Simulation of Post Office Systems.
J. ACM, 1961

1959
A Translation Routine for the DEUCE Computer.
Comput. J., 1959


  Loading...