On a problem of P. Turan concerning graphs

Casimir Zarankiewicz

Displaying similar documents to “On a problem of P. Turan concerning graphs”

On the hyperspace of subcontinua of a finite graph I

R. Duda (1968)

Fundamenta Mathematicae

Similarity:

The planarity theorems of MacLane and Whitney for graph-like continua.

Christian, Robin, Richter, R.Bruce, Rooney, Brendan (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Dual point-partition number of complementary graphs

Anton Kundrík (1990)

Mathematica Slovaca

Similarity:

The k-point-arboricity of a graph

Don R. Lick (1976)

Colloquium Mathematicae

Similarity:

Characterization Of Super-Radial Graphs

K.M. Kathiresan, G. Marimuthu, C. Parameswaran (2014)

Discussiones Mathematicae Graph Theory

Similarity:

In a graph G, the distance d(u, v) between a pair of vertices u and v is the length of a shortest path joining them. The eccentricity e(u) of a vertex u is the distance to a vertex farthest from u. The minimum eccentricity is called the radius, r(G), of the graph and the maximum eccentricity is called the diameter, d(G), of the graph. The super-radial graph R*(G) based on G has the vertex set as in G and two vertices u and v are adjacent in R*(G) if the distance between them in G is...

A generalization of the friendship theorem

Marián Sudolský (1978)

Mathematica Slovaca

Similarity:

Planar Graphs

Hassler Whitney (1933)

Fundamenta Mathematicae

Similarity: