| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646618 | Discrete Mathematics | 2016 | 10 Pages |
Abstract
Given a bicircular matroid B(G)B(G) and q∈{4,5}q∈{4,5}, we characterize when the bicircular matroid B(G)B(G) is GF(q)GF(q)-representable by precisely describing the structure of GG. These descriptions yield polynomial-time algorithms with input GG to certify if B(G)B(G) is or is not GF(q)GF(q)-representable.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Deborah Chun, Tyler Moss, Daniel Slilaty, Xiangqian Zhou,