Matroids versus graphs

1969/01/01 by Frank Harary, Dominic Welsh · 17 citations
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Graph Theory Research #Combinatorics #Mathematics #Matroid

paper · doi:10.1007/bfb0060114

published in Lecture Notes in Mathematics, 155-170 (Springer Berlin Heidelberg)

crossref issued 1969/01/01 · crossref published 1969/01/01 · crossref published-print 1969/01/01 · openalex publication_date 1969/01/01 · crossref published-online 2006/08/22 · crossref created 2006/11/10 · crossref deposited 2021/08/04 · crossref indexed 2025/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11

Citations

• A combinatorial condition for planar graphs
• Euler and bipartite matroids
• On the Number of Husimi Trees
• Minimum partition of a matroid into independent subsets
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Edge-Disjoint Spanning Trees of Finite Graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• On Representatives of Subsets
• Lectures on matroids
• 2-Isomorphic Graphs
• On the Abstract Properties of Linear Dependence

Cited by

• Dual matroid [wikipedia]