EUDML | The crossing numbers of products of a 5-vertex graph with paths and cycles

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

Displaying similar documents to “The crossing numbers of products of a 5-vertex graph with paths and cycles”

A problem concerning $j$ -pancyclic graphs

Vasil Jacoš, Stanislav Jendroľ (1974)

Matematický časopis

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 $j$ -Pancyclic Graphs

Vasil Jacoš (1975)

Matematický časopis

Similarity:

On the crossing numbers of $S_{m} \times P_{n}$ and $S_{m} \times C_{n}$

Stanislav Jendroľ, Mária Ščerbová (1982)

Časopis pro pěstování matematiky

Similarity:

On long cycles through four prescribed vertices of a polyhedral graph

Jochen Harant, Stanislav Jendrol&#039;, Hansjoachim Walther (2008)

Discussiones Mathematicae Graph Theory

Similarity:

For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length at least (1/36)c+(20/3) through any four vertices of G.

Constructive upper bounds for cycle-saturated graphs of minimum size.

Gould, Ronald, Łuczak, Tomasz, Schmitt, John (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity: