Matroids from directed graphs

DOI10.1016/0012-365X(78)90172-3MaRDI QIDQ1250104zbMATH OpenFDO

Authors Laurence R. Matthews

Publication date 1978

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(78)90172-3

Mathematics Subject Classification ID

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

Cites work

• Antidirected Hamiltonian paths in tournaments
• BICIRCULAR MATROIDS
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3387394 (Why is no real title available?)
• Infinite subgraphs as matroid circuits
• On Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits
• On matroids on edge sets of graphs with connected subgraphs as circuits. II
• On subgraphs as matroid cells
• Parallel concepts in graph theory
• Some characterization theorems for circuit spaces associated with graphs

Cited in

(4)

• Biased graphs. II: The three matroids
• Recognizing a class of bicircular matroids
• A Ramsey theorem for biased graphs
• Biased graphs. I: Bias, balance, and gains

This page was built for publication: Matroids from directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250104)