Note on the colouring graphs.
Note on Hamilton Circuits and Hamilton Paths.
On Hamilton Circuits and Hamilton Paths.
On Systems of Paths and Circuits in Graphs.
Circuits in Critical Graphs.
Homomorphism Theorems for Graphs.
A contraction theorem for abstract graphs.
On Complete Graphs and Complete Stars Contained as Subgraphs in Graphs.
Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
On the structure of 5- and 6-chromatic abstract graphs.
Minimally 2-connected graphs.
The number of edges in critical graphs.
Graphs in which Every Finite Path is Contained in a Circuit.
An extremal result for graphs with an application to their colourings.
Page 1