On long cycles through four prescribed vertices of a polyhedral graph

Harant, Jochen GND; Jendrol', Stanislav GND; Walther, Hansjoachim GND

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.

Cite

Citation style:

Harant, Jochen / Jendrol', Stanislav / Walther, Hansjoachim: On long cycles through four prescribed vertices of a polyhedral graph. 2008.

Could not load citation form. Default citation form is displayed.

Rights

Use and reproduction:

Export