Displaying similar documents to “Constructive upper bounds for cycle-saturated graphs of minimum size.”

Fruit salad.

Gyárfás, András (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Characterization of semientire graphs with crossing number 2

D. G. Akka, J. K. Bano (2002)

Mathematica Bohemica

Similarity:

The purpose of this paper is to give characterizations of graphs whose vertex-semientire graphs and edge-semientire graphs have crossing number 2. In addition, we establish necessary and sufficient conditions in terms of forbidden subgraphs for vertex-semientire graphs and edge-semientire graphs to have crossing number 2.

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)