A maximal cover of hexagonal systems
type: Item
instance of: scholarly article
title: A maximal cover of hexagonal systems
zbMATH Open document ID: 0577.05055
DOI: 10.1007/BF02582955
published in: Graphs and Combinatorics
publication date: 1985-01-01T00:00:00Z
review text: The author proves the following theorem: ''Let H be a peri-condensed HS and K be a cover with maximum cardinality. Then \(H\setminus K\) has a unique 1-factor''. Here is used the following terminology: A hexagonal unit cell is a plane region bounded by a regular hexagon of side length 1. A hexagonal system (HS) is a finite connected plane graph with no cut- vertices in which every region is a hexagonal unit cell. A vertex of H lying on the boundary of the exterior region of H is called an external vertex and a vertex not being external is called an internal vertex. If H has internal vertices it is said to be peri-condensed.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 3922705
zbMATH Keywords: cover
zbMATH Keywords: 1-factor
zbMATH Keywords: hexagonal system
author: Maolin Zheng
author: Rongsi Chen
reviewed by: Mirela Ştefănescu
MaRDI profile type: Publication
cites work: Q3039376
full work available at URL: https://doi.org/10.1007/bf02582955
OpenAlex ID: W89062394
description: scientific article; zbMATH DE number 3922705