Idioma:

Gaps in the cycle spectrum of 3-connected cubic planar graphs

Merker, Martin

Journal of combinatorial theory. Series B, 2021-01, Vol.146, p.68-75 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Gaps in the cycle spectrum of 3-connected cubic planar graphs
Autor: Merker, Martin
Assuntos: 3-connected ; Cubic ; Cycle spectrum ; Cycles ; Planar graphs
É parte de: Journal of combinatorial theory. Series B, 2021-01, Vol.146, p.68-75
Descrição: 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].
Editor: Elsevier Inc
Idioma: Inglês

Voltar para lista de resultados