William Staton

According to our database, William Staton authored at least 15 papers between 1982 and 2013.

Collaborative distances:

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

2013

A bound on the values of independence polynomials at -1/<i>k</i>-1/k for <i>k</i>k-degenerate graphs.

John W. Estes, William Staton, Bing Wei

Discret. Math., 2013

2012

Independence polynomials of some compound graphs.

Lanzhen Song, William Staton, Bing Wei

Discret. Appl. Math., 2012

Diatonic Graphs.

John W. Estes, William Staton

Ars Comb., 2012

2010

Independence polynomials of k-tree related graphs.

Lanzhen Song, William Staton, Bing Wei

Discret. Appl. Math., 2010

2009

The isomorphism classes of the generalized Petersen graphs.

Alice Steimle, William Staton

Discret. Math., 2009

2005

A Square-Packing Problem of Erdős.

Connie Maude Campbell, William Staton

Am. Math. Mon., 2005

1999

The Extremal Question for Cycles with Chords.

Asad Ali Ali, William Staton

Ars Comb., 1999

1996

Proof of a Conjecture of Bollob's on Nested Cycles.

Guantao Chen, Paul Erdös, William Staton

J. Comb. Theory, Ser. B, 1996

Sizes of graphs with induced subgraphs of large maximum degree.

Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton

Discret. Math., 1996

On Extremal Graphs With No Long Paths.

Asad Ali Ali, William Staton

Electron. J. Comb., 1996

1995

Degree sequence and independence in K(4)-free graphs.

Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton

Discret. Math., 1995

1991

Degree sequences in triangle-free graphs.

Paul Erdös, Siemion Fajtlowicz, William Staton

Discret. Math., 1991

1985

Graphs with unique maximum independent sets.

Glenn Hopkins, William Staton

Discret. Math., 1985

1984

Induced forests in cubic graphs.

William Staton

Discret. Math., 1984

1982

Extremal bipartite subgraphs of cubic triangle-free graphs.

Glenn Hopkins, William Staton

J. Graph Theory, 1982