On Four Problems in Graph Theory

DOI10.1137/0608014zbMath0614.05036OpenAlexW1992556134MaRDI QIDQ4722099

Sebastiano Mosterts, Ellis L. Johnson

Publication date: 1987

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0608014

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40)

Related Items

Four problems on graphs with excluded minors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakly bipartite graphs and the max-cut problem
• The matroids with the max-flow min-cut property
• Some polyhedra related to combinatorial problems
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Binary group and Chinese postman polyhedra
• On the width—length inequality
• Odd Minimum Cut-Sets and b-Matchings
• The Forbidden Minors of Binary Clutters
• 2-Isomorphic Graphs
• Matching, Euler tours and the Chinese postman
• A Solution of the Shannon Switching Game