Displaying similar documents to “A note on packing graphs without cycles of length up to five.”

A Note on Uniquely Embeddable Forests

Justyna Otfinowska, Mariusz Woźniak (2013)

Discussiones Mathematicae Graph Theory

Similarity:

Let F be a forest of order n. It is well known that if F 6= Sn, a star of order n, then there exists an embedding of F into its complement F. In this note we consider a problem concerning the uniqueness of such an embedding.

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)

Maximal pentagonal packings.

Černý, A., Horák, P., Rosa, A., Znám, Š. (1996)

Acta Mathematica Universitatis Comenianae. New Series

Similarity: