EUDML | A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.”

Note on Induced Subgraphs of the Unit Distance Graph En.

H. Maehara (1989)

Discrete & computational geometry

Similarity:

The k-point-arboricity of a graph

Don R. Lick (1976)

Colloquium Mathematicae

Similarity:

Discussing Graph Theory with a Computer III, Man-machine Theorem Proving

Dragoš M. Cvetković, Irena Pevac (1983)

Publications de l'Institut Mathématique

Similarity:

The determinant concept defined by means of graph theory

D. M. Cvetković (1975)

Matematički Vesnik

Similarity:

Some applications of graph theory in the theory of hypergraphs

J. Nieminen (1975)

Applicationes Mathematicae

Similarity:

Dual point-partition number of complementary graphs

Anton Kundrík (1990)

Mathematica Slovaca

Similarity: