Name
Abstract | ||
|---|---|---|
Abstract Given a bicircular matroid B ( G ) and q ∈ { 4 , 5 } , we characterize when the bicircular matroid B ( G ) is G F ( q ) -representable by precisely describing the structure of G . These descriptions yield polynomial-time algorithms with input G to certify if B ( G ) is or is not G F ( q ) -representable. |
Year | Venue | Field |
|---|---|---|
2016 | Discrete Mathematics | Matroid,Bicircular matroid,Discrete mathematics,Combinatorics,Gain graph,Oriented matroid,Matroid partitioning,Graphic matroid,Weighted matroid,Mathematics |
DocType | Volume | Issue |
Journal | 339 | 9 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deborah Chun | 1 | 4 | 3.52 |
| Tyler Moss | 2 | 0 | 0.34 |
| Daniel C. Slilaty | 3 | 23 | 6.62 |
| Xiangqian Zhou | 4 | 56 | 13.29 |