BibTeX
CSL-JSON
MLA
Harvard
Gaps in the cycle spectrum of 3-connected cubic planar graphs
release_25uecptxhjakrjiggb5mhfmddu
by
Martin Merker
Released
as a article
.
2019
Abstract
We prove that, for every natural number k, every sufficiently large
3-connected cubic planar graph has a cycle whose length is in [k,2k+9]. We
also show that this bound is close to being optimal by constructing, for every
even k≥ 4, an infinite family of 3-connected cubic planar graphs that
contain no cycle whose length is in [k,2k+1].
In text/plain
format
Archived Files and Locations
application/pdf 297.1 kB
file_yfnyyxze3namlixlygx6c3upk4
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1905.09101v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links