The distance between various orientations of a graph

Bohdan Zelinka

Displaying similar documents to “The distance between various orientations of a graph”

On some Ramsey and Turán-type numbers for paths and cycles.

Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Distances between directed graphs

Bohdan Zelinka (1987)

Časopis pro pěstování matematiky

Similarity:

Natural bijections between directed and undirected self-complementary graphs

Bohdan Zelinka (1987)

Mathematica Slovaca

Similarity:

Small directed graphs as neighbourhood graphs

Bohdan Zelinka (1988)

Czechoslovak Mathematical Journal

Similarity:

The Turàn number of the graph 3P4

Halina Bielak, Sebastian Kieliszek (2014)

Annales UMCS, Mathematica

Similarity:

Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let Pi denote a path consisting of i vertices and let mPi denote m disjoint copies of Pi. In this paper we count ex(n, 3P4)

Uniquely edge colourable graphs

Juraj Bosák (1984)

Mathematica Slovaca

Similarity: