Carol A. Whitehead

According to our database, Carol A. Whitehead authored at least 8 papers between 1989 and 2008.

Collaborative distances:

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

2008

Decycling sets in certain cartesian product graphs with one factor complete.

Bert L. Hartnell, Carol A. Whitehead

Australas. J Comb., 2008

2007

A note on the Erdos-Farber-Lovász conjecture.

Bill Jackson, G. Sethuraman, Carol A. Whitehead

Discret. Math., 2007

2003

Observability of the extended Fibonacci cubes.

Carol A. Whitehead, Norma Zagaglia Salvi

Discret. Math., 2003

On a Problem on Generalised Fibonacci Cubes.

Titus Hilberdink, Carol A. Whitehead, Norma Zagaglia Salvi

Ars Comb., 2003

2001

Ordered graceful labellings of the 2-star.

Richard J. Nowakowski, Carol A. Whitehead

Discret. Math., 2001

1997

On k-packings of graphs.

Bert L. Hartnell, Carol A. Whitehead

Ars Comb., 1997

1994

A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets.

Art S. Finbow, Bert L. Hartnell, Carol A. Whitehead

Discret. Math., 1994

1989

Alternating cycles in edge-colored graphs.

Carol A. Whitehead

J. Graph Theory, 1989