Login / Signup

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

Yves AubryJean-Christophe GodinOlivier Togni
Published in: Discret. Appl. Math. (2014)
Keyphrases
  • lattice structure
  • real world
  • np hard
  • evolutionary algorithm
  • graph properties
  • square grid