Abstract
Given a bicircular matroid B(G) and q∈{4,5}, we characterize when the bicircular matroid B(G) is GF(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 GF(q)-representable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
