On the existence of graphs with a certain ordering of vertices

Jiří Rosický

Displaying similar documents to “On the existence of graphs with a certain ordering of vertices”

Distance in graphs

Roger C. Entringer, Douglas E. Jackson, D. A. Snyder (1976)

Czechoslovak Mathematical Journal

Similarity:

On the number of cut-vertices in a graph.

Hopkins, Glenn, Staton, William (1989)

International Journal of Mathematics and Mathematical Sciences

Similarity:

The ramsey number for theta graph versus a clique of order three and four

M.S.A. Bataineh, M.M.M. Jaradat, M.S. Bateeha (2014)

Discussiones Mathematicae Graph Theory

Similarity:

For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph. In this paper, we consider the Ramsey numbers for theta-complete graphs. We determine r(θn,Km) for m = 2, 3, 4 and n > m. More specifically, we establish that r(θn,Km) = (n − 1)(m − 1) + 1 for m = 3, 4 and n > m

On decompositions of complete graphs into factors with given diameters and radii

Ľudovít Niepel (1980)

Mathematica Slovaca

Similarity:

On decompositions of complete graphs into three factors with given diameters

Pavel Hrnčiar (1990)

Czechoslovak Mathematical Journal

Similarity: