Richard P. Vitray

According to our database, Richard P. Vitray authored at least 11 papers between 1991 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

Irregular colorings of regular graphs.

Mark Anderson, Richard P. Vitray, Jay Yellen

Discret. Math., 2012

2004

Extremal connected graphs for independent domination number.

Robert C. Brigham, Julie R. Carrington, Richard P. Vitray

Discret. Math., 2004

2003

Change in Additive Bandwidth When an Edge is Added.

Robert C. Brigham, Julie R. Carrington, Richard P. Vitray, Donna J. Williams, Jay Yellen

Ars Comb., 2003

2002

On Essential and Inessential Polygons in Embedded Graphs.

R. Bruce Richter, Richard P. Vitray

J. Comb. Theory B, 2002

2000

An extremal bandwidth problem for bipartite graphs.

Robert C. Brigham, Julie R. Carrington, Ronald D. Dutton, Joseph Fiedler, Richard P. Vitray

J. Graph Theory, 2000

Domination Sequences.

Robert C. Brigham, Julie R. Carrington, Richard P. Vitray

Ars Comb., 2000

1999

Bipartite Graphs and Absolute Difference Tolerances.

Robert C. Brigham, Julie R. Carrington, Richard P. Vitray

Ars Comb., 1999

1996

Planar graphs on the projective plane.

Bojan Mohar, Neil Robertson, Richard P. Vitray

Discret. Math., 1996

Two - ø - Tolerance Competition Graphs.

Robert C. Brigham, Fred R. McMorris, Richard P. Vitray

Discret. Appl. Math., 1996

1992

The 2 and 3 representative projective planar embeddings.

Richard P. Vitray

J. Comb. Theory B, 1992

1991

Representativity and flexibility on the projective plane.

Richard P. Vitray

Proceedings of the Graph Structure Theory, 1991