Determining when a graphic matroid is transversal in linear time

DOI10.1080/03081088508817642zbMath0555.05023OpenAlexW1986879013WikidataQ126250162 ScholiaQ126250162MaRDI QIDQ3218144

Paul A. Kaschube

Publication date: 1985

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088508817642

zbMATH Keywords

algorithmgraphic matroidstransversal matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Forbidden subgraphs and graph decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs
• Finding triconnected components of graphs
• Efficient Planarity Testing
• TRANSVERSAL MATROIDS, BASE-ORDERABLE MATROIDS, AND GRAPHS