An algorithm for constructing edge‐trees from hypergraphs

This publication has 9 references indexed in Scilit:

• Recognizing graphic matroids
  Combinatorica, 1981
• Converting Linear Programs to Network Problems
  Mathematics of Operations Research, 1980
• A recognition algorithm for the intersection graphs of paths in trees
  Discrete Mathematics, 1978
• Graphic matroids and the multicommodity transportation problem
  Mathematical Programming, 1977
• A recognition algorithm for the intersection graphs of directed paths in directed trees
  Discrete Mathematics, 1975
• Transitive Orientation of Graphs and Identification of Permutation Graphs
  Canadian Journal of Mathematics, 1971
• Lectures on matroids
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
  Proceedings of the American Mathematical Society, 1960
• Matroids and graphs
  Transactions of the American Mathematical Society, 1959