William Staton

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
A bound on the values of independence polynomials at -1/k-1/k for kk-degenerate graphs.
Discrete Mathematics, 2013

2012
Independence polynomials of some compound graphs.
Discrete Applied Mathematics, 2012

Diatonic Graphs.
Ars Comb., 2012

2010
Independence polynomials of k-tree related graphs.
Discrete Applied Mathematics, 2010

2009
The isomorphism classes of the generalized Petersen graphs.
Discrete Mathematics, 2009

2005
A Square-Packing Problem of Erdős.
The American Mathematical Monthly, 2005

1999
The Extremal Question for Cycles with Chords.
Ars Comb., 1999

1996
Proof of a Conjecture of Bollob's on Nested Cycles.
J. Comb. Theory, Ser. B, 1996

Sizes of graphs with induced subgraphs of large maximum degree.
Discrete Mathematics, 1996

On Extremal Graphs With No Long Paths.
Electr. J. Comb., 1996

1995
Degree sequence and independence in K(4)-free graphs.
Discrete Mathematics, 1995

1991
Degree sequences in triangle-free graphs.
Discrete Mathematics, 1991

1985
Graphs with unique maximum independent sets.
Discrete Mathematics, 1985

1984
Induced forests in cubic graphs.
Discrete Mathematics, 1984

1982
Extremal bipartite subgraphs of cubic triangle-free graphs.
Journal of Graph Theory, 1982


  Loading...