Hypergraphes arbores
From MaRDI portal
Publication:1252357
DOI10.1016/0012-365X(78)90154-1zbMath0393.05039OpenAlexW4212835401WikidataQ127871981 ScholiaQ127871981MaRDI QIDQ1252357
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)90154-1
Related Items (14)
\(r\)-dominating cliques in graphs with hypertree structure ⋮ On neighborhood-Helly graphs ⋮ Algorithmic aspects of intersection graphs and representation hypergraphs ⋮ Vertices removal for feasibility of clustered spanning trees ⋮ Homogeneously orderable graphs ⋮ Homogeneously orderable graphs and the Steiner tree problem ⋮ Dually chordal graphs ⋮ Parsimonious cluster systems ⋮ Combinatorial optimisation and hierarchical classifications ⋮ From hypertrees to arboreal quasi-ultrametrics ⋮ Optimisation and hypergraph theory ⋮ Hypergraph families with bounded edge cover or transversal number ⋮ Arbres minimaux d'un graphe preordonne ⋮ A characterization of totally balanced hypergraphs
Cites Work
This page was built for publication: Hypergraphes arbores
