On maximal resonance of polyomino graphs |
| |
Authors: | Saihua Liu Jianping Ou |
| |
Institution: | 1. Department of Mathematics, Wuyi University, Jiangmen, 529020, People’s Republic of China
|
| |
Abstract: | A polyomino graph is a finite plane 2-connected bipartite graph every interior face of which is bounded by a regular square of side length one. Let k be a positive integer, a polyomino graph G is k-resonant if the deletion of any i ≤ k vertex-disjoint squares from G results in a graph either having perfect matchings or being empty. If graph G is k-resonant for any integer k ≥ 1, then it is called maximally resonant. All maximally resonant polyomino graphs are characterized in this work. As a result, the least integer k such that a k-resonant polyomino graph is maximally resonant is determined. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|