Methods of destroying the symmetries of a graph.
A graph and its complement with specified properties. III: Girth and circumference.
On the structure of a triangle-free infinite-chromatic graph of Gyarfas.
A graph and its complement with specified properties. I: Connectivity.
An interpolation theorem for graphical homomorphisms
Some properties of n-adic relations
Conditional Graph Theory III: Independence Numbers
The theory of tournaments: A miniature mathematical system
Partitions into sum-free sets.
Smallest cubic and quartic graphs with a given number of cutpoints and bridges.
On the Problem of Reconstructing a Tournament from Subtournaments.
Every forest can be obtained from a minimal block.
On the Corona of Two Graphs. (Short Communication).
On the Corona of Two Graphs.
The degree sets of connected infinite graphs
Planar Permutation Graphs
On the number of cycles in a graph
Minimum maximal graphs with forbidden subgraphs
Which directed graphs have a solution?
On the Point-Core of a Graph.
Page 1 Next