Competition graphs of strongly connected and Hamiltonian digraphs von FRAUGHNAUGH, K. F, LUNDGREN, J. R, MERZ, S. K, MAYBEE, J. S, PULLMAN, N. J

Volltext

Path assignment for call routing: An application of tabu search von Anderson, Charles A., Fraughnaugh, Kathryn, Parker, Mark, Ryan, Jennifer

Volltext

The Domination Number of Cubic Graphs with Girth at least Five von Fisher, David C., Fraughnaugh, Kathryn, Seager, Suzanne M.

Volltext

Lower bounds on size and independence in K4-free graphs von Fraughnaugh, Kathryn L., Locke, Stephen C.

Volltext

Lower bounds on size and independence inK4-free graphs von Fraughnaugh, Kathryn L., Locke, Stephen C.

Volltext

Size in maximal triangle-free graphs and minimal graphs of diameter 2 von Barefoot, Curtiss, Casey, Karen, Fisher, David, Fraughnaugh, Kathryn, Harary, Frank

Volltext

The Number of Dependent Arcs in an Acyclic Orientation von Fisher, David C., Fraughnaugh, Kathryn, Langley, Larry, West, Douglas B.

Volltext

Size and independence in triangle-free graphs with maximum degree three von Jones, Kathryn Fraughnaugh

Volltext

Finding independent sets in triangle-free graphs von FRAUGHNAUGH, K, LOCKE, S. C

Volltext

Conditional chromatic numbers with forbidden cycles von Dargen, Karen Casey, Fraughnaugh, Kathryn

Volltext

Independence in graphs with maximum degree four von Jones, Kathryn Fraughnaugh

Volltext

Introduction to graph theory von Fraughnaugh, Kathryn L.

Volltext