Hypergraphs and the Clar problem in hexagonal systems

DOI10.1016/J.DISOPT.2006.07.001zbMath1112.90045OpenAlexW2027860144MaRDI QIDQ865759

Khaled Salem, Hernán G. Abeledo

Publication date: 20 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.07.001

zbMATH Keywords

Helly propertyhexagonal systemresonant setseparable hypergraph

Mathematics Subject Classification ID

Operations research and management science (90B99)

Cites Work

• The Clar covering polynomial of hexagonal systems. I
• The Clar covering polynomial of hexagonal systems. III
• Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hypergraphs and the Clar problem in hexagonal systems