11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs) von Fraughnaugh, K., Locke, S.C.

Volltext

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

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

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

Volltext

Heuristics for efficient classification von Fraughnaugh, K., Zullo, H., Cox, L.A., Ryan, J.

Volltext bestellen

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

Volltext

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

Volltext

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

Volltext