scientific article; zbMATH DE number 1109417
A hexagonal system is a finite connected plane graph with no cut-vertices in which every interior region is bounded by a regular hexagon of side length 1. A coronoid system \(G\) is a subgraph of a hexagonal system \(H\) which can be obtained from \(H\) by deleting some interior vertices and/or some interior edges such that each edge of \(G\) belongs to at least one hexagon of \(G\). A polyhex graph is either a hexagonal system or a coronoid system. A polyhex graph \(G\) is said to be \(k\)-coverable if for any \(k\) mutually disjoint hexagons the subgraph obtained from \(G\) by deleting all these \(k\) hexagons together with their incident edges has at least one perfect matching. In this paper a constructive criterion is given to determine whether or not a given polyhex graph is \(k\)-coverable (for \(k\geq 3\)). From this criterion follows that for any \(k,l\geq 3\) a polyhex graph \(G\) is \(k\)-coverable if and only if \(G\) is \(l\)-coverable. Furthermore, a simple but not very effective method is developed which allows us to determine whether or not there exists a \(k\)-coverable polyhex graph (and how it looks) with exactly \(h\) hexagons.
- A maximal cover of hexagonal systems
- scientific article; zbMATH DE number 3859146 (Why is no real title available?)
- Hexagonal resonance of (3,6)-fullerenes
- scientific article; zbMATH DE number 1076151 (Why is no real title available?)
- Covering polyhexes with hexagons
- Maximally resonant polygonal systems
- A complete characterization for k-resonant Klein-bottle polyhexes
- \(k\)-resonant toroidal polyhexes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4374729)