The Turàn number of the graph 3P4

Halina Bielak; Sebastian Kieliszek

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “The Turàn number of the graph 3P4”

On the minimal length of the longest trail in a fixed edge-density graph

Vajk Szécsi (2013)

Open Mathematics

Similarity:

A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).

Decompositions of graphs into 5-cycles and other small graphs.

Sousa, Teresa (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

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:

Eulerian polar graphs

Bohdan Zelinka (1976)

Czechoslovak Mathematical Journal

Similarity:

A note on the edge-connectivity of cages.

Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The decomposition of a generalized graph into isomorphic subgraphs

Bohdan Zelinka (1968)

Časopis pro pěstování matematiky

Similarity: