Julie Haviland

According to our database, Julie Haviland authored at least 17 papers between 1989 and 2013.

Collaborative distances:

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

2013

Independent dominating sets in regular graphs.

Julie Haviland

J. Comb. Optim., 2013

2008

Independent domination in triangle-free graphs.

Julie Haviland

Discret. Math., 2008

On independent domination and size.

Julie Haviland

Australas. J Comb., 2008

A note on independent domination in graphs of girth 6.

Julie Haviland

Australas. J Comb., 2008

A note on independent domination in graphs of girth 5.

Julie Haviland

Australas. J Comb., 2008

2007

Upper bounds for independent domination in regular graphs.

Julie Haviland

Discret. Math., 2007

2006

On Irregularity In Graphs.

Julie Haviland

Ars Comb., 2006

1997

Independence and Average Distance in Graphs.

Peter Firby, Julie Haviland

Discret. Appl. Math., 1997

Maximal Spacing Configurations in Graphs.

Peter Firby, Julie Haviland

Comb. Probab. Comput., 1997

1996

The rotation index of a graph.

Robin J. Chapman, Julie Haviland

Ars Comb., 1996

1995

Independent domination in regular graphs.

Julie Haviland

Discret. Math., 1995

1993

Generalized Rotation numbers.

Robin J. Chapman, Julie Haviland

J. Graph Theory, 1993

1992

Rotation numers for complete bipartite graphs.

Julie Haviland, Andrew Thomason

J. Graph Theory, 1992

On testing the 'pseudo-randomness' of a hypergraph.

Julie Haviland, Andrew Thomason

Discret. Math., 1992

1991

Rotation numbers for complete tripartite graphs.

Julie Haviland, Andrew Thomason

Graphs Comb., 1991

On minimum maximal independent sets of a graph.

Julie Haviland

Discret. Math., 1991

1989

Pseudo-random hypergraphs.

Julie Haviland, Andrew Thomason

Discret. Math., 1989