scientific article; zbMATH DE number 3993625

MaRDI QIDQ4722101zbMATH OpenFDO

Authors A. S. Azarënok, Vladimir I. Sarvanov

Publication date 1986

zbMATH Keywords

algorithmhypergraphminimal realizationstrict realization

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 4075121
• scientific article; zbMATH DE number 4101253
• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
• Realization of hypergraphs by trees of minimal diameter
• scientific article; zbMATH DE number 1155345

Cited in

(10)

• scientific article; zbMATH DE number 1155345 (Why is no real title available?)
• On constructing the minimal realizations of hypergraphs
• scientific article; zbMATH DE number 4075121 (Why is no real title available?)
• scientific article; zbMATH DE number 4041960 (Why is no real title available?)
• Realization of hypergraphs by trees of minimal diameter
• scientific article; zbMATH DE number 2107061 (Why is no real title available?)
• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
• Hypergraph edge representations with the use of homological paths
• scientific article; zbMATH DE number 4101253 (Why is no real title available?)
• scientific article; zbMATH DE number 3976776 (Why is no real title available?)

This page was built for publication:

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