Graph partitioning and bisection represent fundamental questions in combinatorial optimisation, concerned with dividing the vertices of a graph into disjoint subsets while balancing size constraints ...
Graph saturation problems concern the minimal conditions under which adding any new edge to a given graph or hypergraph forces the appearance of a specified forbidden structure. In its simplest form, ...
In 1986, then-Fort Wayne Mayor Win Moses Jr. proclaimed March 10-15 to be Fort Wayne Graph Theory Week and urged “all citizens, community organizations, scholars, and conference participants, to join ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results