Z-Transformation Graphs of Perfect Matchings of Hexagonal Systems

Author(s):  
Zhang Fu-Ji ◽  
Guo Xiao-Feng ◽  
Chen Rong-Si
1988 ◽  
Vol 72 (1-3) ◽  
pp. 405-415 ◽  
Author(s):  
Zhang Fu-ji ◽  
Guo Xiao-feng ◽  
Chen Rong-si

COMBINATORICA ◽  
1984 ◽  
Vol 4 (1) ◽  
pp. 89-99 ◽  
Author(s):  
Horst Sachs

2004 ◽  
Vol 276 (1-3) ◽  
pp. 393-404 ◽  
Author(s):  
Heping Zhang ◽  
Fuji Zhang ◽  
Haiyuan Yao

2021 ◽  
Vol 1 (1) ◽  
pp. 87-96
Author(s):  
Hong Chang ◽  
Yong-De Feng ◽  
Hong Bian ◽  
Shou-Jun Xu

Let G be a graph with edge set E(G) that admits a perfect matching M. A forcing set of M is a subset of M contained in no other perfect matchings of G. A complete forcing set of G, recently introduced by Xu et al. [Complete forcing numbers of catacondensed hexagonal systems, J. Combin. Optim. 29(4) (2015) 803-814], is a subset of E(G) on which the restriction of any perfect matching M is a forcing set of M. The minimum possible cardinality of complete forcing sets of G is the complete forcing number of G. In this article, we discuss the complete forcing number of rectangular polyominoes (or grids), i.e., the Cartesian product of two paths of various lengths, and show explicit formulae for the complete forcing numbers of rectangular polyominoes in terms of the lengths.


1985 ◽  
Vol 1 (1) ◽  
pp. 383-386 ◽  
Author(s):  
Zhang Fu-ji ◽  
Chen Rong-si ◽  
Guo Xiao-fong

Sign in / Sign up

Export Citation Format

Share Document