Kathryn Fraughnaugh

According to our database1, Kathryn Fraughnaugh authored at least 12 papers between 1993 and 2005.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
Maximal-clique Partitions of Different Sizes.
Ars Comb., 2005

2002
The Domination Number of Cubic Graphs with Girth at least Five.
Electron. Notes Discret. Math., 2002

1998
Heuristics for efficient classification.
Ann. Oper. Res., 1998

1997
Introduction to graph theory.
Networks, 1997

Lower bounds on size and independence in <i>K</i><sub>4</sub>-free graphs.
J. Graph Theory, 1997

The Number of Dependent Arcs in an Acyclic Orientation.
J. Comb. Theory B, 1997

P3-Connected Graphs of Minimum Size.
Ars Comb., 1997

1996
Finding Independent Sets in Triangle-free Graphs.
SIAM J. Discret. Math., 1996

1995
Competition Graphs of Strongly Connected and Hamiltonian Digraphs.
SIAM J. Discret. Math., 1995

11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs).
J. Comb. Theory B, 1995

Size in maximal triangle-free graphs and minimal graphs of diameter 2.
Discret. Math., 1995

1993
Path assignment for call routing: An application of tabu search.
Ann. Oper. Res., 1993


  Loading...