Idioma:

Choosability of the square of planar subcubic graphs with large girth

Havet, F.

Discrete mathematics, 2009-06, Vol.309 (11), p.3553-3563 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Choosability of the square of planar subcubic graphs with large girth
Autor: Havet, F.
Assuntos: Bounded density ; Computer Science ; Discrete Mathematics ; List colouring ; Planar graph ; Square of a graph
É parte de: Discrete mathematics, 2009-06, Vol.309 (11), p.3553-3563
Descrição: We show that the choice number of the square of a subcubic graph with maximum average degree less than 18 / 7 is at most 6. As a corollary, we get that the choice number of the square of a subcubic planar graph with girth at least 9 is at most 6. We then show that the choice number of the square of a subcubic planar graph with girth at least 13 is at most 5.
Editor: Elsevier B.V
Idioma: Inglês

Links

Voltar para lista de resultados