Hypergraphes de chaînes d'aretes d'un arbre

DOI10.1016/0012-365X(83)90018-3zbMath0495.05049OpenAlexW1963852739MaRDI QIDQ1169485

Jean-Claude Fournier

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90018-3

zbMATH Keywords

binary matroidedge-path hypergraph of a treegraphical matroidinterval hypergraphs

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

Algorithmic aspects of intersection graphs and representation hypergraphs ⋮ A monadic second-order definition of the structure of convex hypergraphs. ⋮ On the complexity of recognizing directed path families ⋮ Recognizing Helly edge-path-tree graphs and their clique graphs ⋮ A superclass of edge-path-tree graphs with few cliques ⋮ Integrality properties of edge path tree families

Cites Work

• Une rélation de séparation entre cocircuits d'un matroide
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hypergraphes de chaînes d'aretes d'un arbre