When each hexagon of a hexagonal system covers it

When each hexagon of a hexagonal system covers it

0.00 Avg rating0 Votes
Article ID: iaor19911661
Country: Netherlands
Volume: 30
Issue: 1
Start Page Number: 63
End Page Number: 75
Publication Date: Jan 1991
Journal: Discrete Applied Mathematics
Authors: ,
Abstract:

In this paper the authors establish a simple criterion which enables them to determine whether or not a hexagonal system H has the property that each hexagon s of H is resonant, i.e., the subgraph obtained by deleting from H the vertices of s together with their edges has at least one perfect matching.

Reviews

Required fields are marked *. Your email address will not be published.