John T. Saccoman

According to our database1, John T. Saccoman authored at least 6 papers between 1996 and 2013.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
On Component Order Edge Connectivity Of a Complete Bipartite Graph.
Ars Comb., 2013

2010
Graphs with the maximum or minimum number of 1-factors.
Discret. Math., 2010

2009
A generalization of an edge-connectivity theorem of Chartrand.
Networks, 2009

2007
A correction in the formula for the number of spanning trees in threshold graphs.
Australas. J Comb., 2007

1998
Uniformly optimally reliable graphs.
Networks, 1998

1996
Uniformly least reliable graphs.
Networks, 1996


  Loading...