Page 1

Displaying 1 – 8 of 8

Showing per page

Small Ramsey numbers.

Radziszowski, Stanisław P. (1996)

The Electronic Journal of Combinatorics [electronic only]

Some applications of pq-groups in graph theory

Geoffrey Exoo (2004)

Discussiones Mathematicae Graph Theory

We describe some new applications of nonabelian pq-groups to construction problems in Graph Theory. The constructions include the smallest known trivalent graph of girth 17, the smallest known regular graphs of girth five for several degrees, along with four edge colorings of complete graphs that improve lower bounds on classical Ramsey numbers.

Structural results on maximal k-degenerate graphs

Allan Bickle (2012)

Discussiones Mathematicae Graph Theory

A graph is k-degenerate if its vertices can be successively deleted so that when deleted, each has degree at most k. These graphs were introduced by Lick and White in 1970 and have been studied in several subsequent papers. We present sharp bounds on the diameter of maximal k-degenerate graphs and characterize the extremal graphs for the upper bound. We present a simple characterization of the degree sequences of these graphs and consider related results. Considering edge coloring, we conjecture...

Currently displaying 1 – 8 of 8

Page 1