Matroids from directed graphs

DOI10.1016/0012-365X(78)90172-3zbMath0388.05005MaRDI QIDQ1250104

Laurence R. Matthews

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Recognizing a class of bicircular matroids ⋮ Biased graphs. II: The three matroids ⋮ A Ramsey Theorem for Biased Graphs ⋮ Biased graphs. I: Bias, balance, and gains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite subgraphs as matroid circuits
• On matroids on edge sets of graphs with connected subgraphs as circuits. II
• Some characterization theorems for circuit spaces associated with graphs
• Parallel concepts in graph theory
• On subgraphs as matroid cells
• BICIRCULAR MATROIDS
• On Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits
• Antidirected Hamiltonian paths in tournaments

This page was built for publication: Matroids from directed graphs