Reconstructing a Graph from the Incidence Relation on its Edge Set
Bohdan Zelinka (1972)
Matematický časopis
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Blueprint for a classic proof of the 4 colour theorem”
Reconstructing a Graph from the Incidence Relation on its Edge Set
On the completeness-number of a finite graph. II.
Ivan Havel (1968)
Časopis pro pěstování matematiky
Similarity:
On some graph-theoretical problems of V. G. Vizing
Bohdan Zelinka (1973)
Časopis pro pěstování matematiky
Similarity:
Computing radial drawings on the minimum number of circles.
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk (2005)
Journal of Graph Algorithms and Applications
Similarity: