Indexed by：
Abstract：
A coronoid system G is k-coverable if for every k (or fewer) pairwise 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, some criteria are given to determine whether or not a given coronoid system is k-coverable. © 1993 J.C. Baltzer AG, Science Publishers.
Keyword：
Reprint 's Address：
Email：
Source ：
Journal of Mathematical Chemistry
ISSN： 0259-9791
Year： 1993
Issue： 1
Volume： 12
Page： 147-162
1 . 7 0 0
JCR@2023
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
