A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.
P.M. Vaidya (1991)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Note on Induced Subgraphs of the Unit Distance Graph En.”
A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.
The k-point-arboricity of a graph
Don R. Lick (1976)
Colloquium Mathematicae
Similarity:
Some applications of graph theory in the theory of hypergraphs
J. Nieminen (1975)
Applicationes Mathematicae
Similarity:
The determinant concept defined by means of graph theory
D. M. Cvetković (1975)
Matematički Vesnik
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:
A generalization of the friendship theorem
Marián Sudolský (1978)
Mathematica Slovaca
Similarity:
Dual point-partition number of complementary graphs
Anton Kundrík (1990)
Mathematica Slovaca
Similarity: