Indexed by：
Abstract：
We prove that there is no polynomial p(·) with the property that a matroid M can be determined to be either a lifted-graphic or frame matroid using at most p(|M|) rank evaluations. This resolves two conjectures of Geelen, Gerards, and Whittle (Quasi-graphic matroids, to appear in J. Graph Theory). © 2017 Wiley Periodicals, Inc.
Keyword：
Reprint 's Address：
Email：
Source ：
Journal of Graph Theory
ISSN： 0364-9024
Year： 2018
Issue： 1
Volume： 87
Page： 72-76
0 . 8 8 3
JCR@2018
0 . 9 0 0
JCR@2023
ESI HC Threshold：68
JCR Journal Grade：2
CAS Journal Grade：3
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：
