Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable

DOI10.1016/j.dam.2013.09.028zbMath1283.05182arXiv1110.2650OpenAlexW2010988265MaRDI QIDQ2636827

Jean-Christophe Godin, Olivier Togni, Yves Aubry

Publication date: 18 February 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.2650

zbMATH Keywords

weighted graphtriangular latticechoosabilityradio channel assignment

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)

Related Items (2)

Free choosability of outerplanar graphs ⋮ Distributed algorithms for fractional coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results on \((a:b)\)-choosability
• Choosability of the square of planar subcubic graphs with large girth
• Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
• Choosability and fractional chromatic numbers
• List edge and list total colourings of multigraphs
• The chromatic number of a graph of girth 5 on a fixed surface
• Choosability of planar graphs
• A Hajós-like theorem for list coloring
• A technique for multicoloring triangle-free hexagonal graphs
• Channel assignment and weighted coloring
• Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs
• Channel assignment and multicolouring of the induced subgraphs of the triangular lattice

This page was built for publication: Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable