Unavoidable minors of large 4-connected bicircular matroids

DOI10.1007/s00026-015-0256-yzbMath1310.05043OpenAlexW2059669064MaRDI QIDQ2343466

Xiangqian Zhou, Tyler Moss, Deborah Chun, Daniel C. Slilaty

Publication date: 5 May 2015

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://corescholar.libraries.wright.edu/cgi/viewcontent.cgi?article=1321&context=math

zbMATH Keywords

bicircular matroidunavoidable minor4-connected bicircular monoidinternally 4-connected bicircular monoidvertically 4-connected bicircular monoid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Typical subgraphs of 3- and 4-connected graphs
• Connectivity in frame matroids
• Connectivity in bicircular matroids
• Biased graphs. II: The three matroids
• Unavoidable minors of large 3-connected matroids
• Tight bounds on maximal and maximum matchings
• BICIRCULAR MATROIDS

This page was built for publication: Unavoidable minors of large 4-connected bicircular matroids