Fruit salad.
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Constructive upper bounds for cycle-saturated graphs of minimum size.”
Fruit salad.
Independence number and disjoint theta graphs.
Fujita, Shinya, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
Independence number of 2-factor-plus-triangles graphs.
Vandenbussche, Jennifer, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
For which graphs does every edge belong to exactly two chordless cycles?
Peled, Uri N., Wu, Julin (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the identification of vertices using cycles.
Rosendahl, Petri (2003)
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.
Graph equations for line graphs and n-th distance graphs.
Simic, Slobodan K. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
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)