Realization of hypergraphs by trees of minimal diameter

DOI10.1515/DMA.1997.7.3.279zbMATH Open0965.05076OpenAlexW2057101699MaRDI QIDQ4522751FDOQ4522751

Authors: O. I. Mel'nikov 

Publication date: 7 March 2001

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

Full work available at URL: https://doi.org/10.1515/dma.1997.7.3.279

Recommendations

• Graph-Theoretic Concepts in Computer Science
• Publication:4722101
• scientific article; zbMATH DE number 1155345
• scientific article; zbMATH DE number 1155352
• scientific article; zbMATH DE number 4075121

zbMATH Keywords

treealgorithmhypergraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65)

Cited In (7)

• On constructing the minimal realizations of hypergraphs
• Title not available (Why is that?)
• The role of twins in computing planar supports of hypergraphs
• Title not available (Why is that?)
• Graph-Theoretic Concepts in Computer Science
• Title not available (Why is that?)
• Minimum tree supports for hypergraphs and low-concurrency Euler diagrams

This page was built for publication: Realization of hypergraphs by trees of minimal diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522751)