A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The crossing numbers of products of a 5-vertex graph with paths and cycles”
A problem concerning -pancyclic graphs
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 -Pancyclic Graphs
Vasil Jacoš (1975)
Matematický časopis
Similarity:
On the crossing numbers of and
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', 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: