A generalization of the pentomino exclusion problem: dislocation of graphs

DOI10.1016/j.disc.2005.09.036zbMath1112.05024OpenAlexW2046145508MaRDI QIDQ864131

Charles Payan, Sylvain Gravier, Julien Moncel

Publication date: 13 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.036

zbMATH Keywords

fasciagraph

Mathematics Subject Classification ID

Polyominoes (05B50)

Related Items (3)

A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs ⋮ Identifying codes in some subgraphs of the square lattice ⋮ Generic algorithms for some decision problems on fasciagraphs and rotagraphs

Cites Work

• Linear and combinatorial optimization in ordered algebraic structures
• Algebraic approach to fasciagraphs and rotagraphs
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• On the pentomino exclusion problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of the pentomino exclusion problem: dislocation of graphs