Perfect matchings of generalized polyomino graphs - Details

author：

Si, C.R. (Si, C.R..) ^[1]

Indexed by：

Scopus

Abstract：

In　this　paper　necessary　and　sufficient　conditions　are　given　for　a　generalized　polyomino　graph　to　have　a　perfect　matching　and　to　be　elementary,　respectively.　©　Springer-Verlag　2005.

Keyword：

Community：

[ 1 ] [Si, C.R.]Department of Statistics, College of Management, Fuzhou University, Fuzhou, Fujian, China
[ 2 ] [Si, C.R.]Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou, Fujian, China

Reprint 's Address：

[Si, C.R.]Department of Statistics, College of Management, Fuzhou University, Fuzhou, Fujian, China

Email：

chenrongsi@fzu.edu.cn

Show more details

Related Keywords：

Source ：

Graphs and Combinatorics

ISSN： 0911-0119

Year： 2005

Issue： 4

Volume： 21

Page： 515-529

0 . 2 9 9

JCR@2005

0 . 6 0 0

JCR@2023

JCR Journal Grade：4

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count：

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 3

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to