Recent Activity
Switching reconstruction of digraphs ★★
Keywords:
Switching reconstruction conjecture ★★
Author(s): Stanley
Keywords: reconstruction
Every 4-connected toroidal graph has a Hamilton cycle ★★
Author(s): Grunbaum; Nash-Williams
Keywords:
Acyclic list colouring of planar graphs. ★★★
Author(s): Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena
Keywords:
Earth-Moon Problem ★★
Author(s): Ringel
Keywords:
Triangle-packing vs triangle edge-transversal. ★★
Author(s): Tuza
Keywords:
Odd-cycle transversal in triangle-free graphs ★★
Author(s): Erdos; Faudree; Pach; Spencer
Keywords:
Simultaneous partition of hypergraphs ★★
Keywords:
Complexity of the H-factor problem. ★★
An -factor in a graph is a set of vertex-disjoint copies of covering all vertices of .
Keywords:
Subgraph of large average degree and large girth. ★★
Author(s): Thomassen
Keywords:
Turán number of a finite family. ★★
Author(s): Erdos; Simonovits
Given a finite family of graphs and an integer , the Turán number of is the largest integer such that there exists a graph on vertices with edges which contains no member of as a subgraph.
Keywords:
Subdivision of a transitive tournament in digraphs with large outdegree. ★★
Author(s): Mader
Keywords:
Large induced forest in a planar graph. ★★
Keywords:
Lovász Path Removal Conjecture ★★
Author(s): Lovasz
Keywords:
Partition of a cubic 3-connected graphs into paths of length 2. ★★
Author(s): Kelmans
Keywords:
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour. ★★
Author(s): Sabidussi
Keywords:
Decomposing an eulerian graph into cycles. ★★
Author(s): Hajós
Keywords:
Decomposing a connected graph into paths. ★★★
Author(s): Gallai
Keywords:
Melnikov's valency-variety problem ★
Author(s): Melnikov
Keywords:
Coloring the union of degenerate graphs ★★
Author(s): Tarsi
Keywords: