scientific article; zbMATH DE number 3993625

zbMATH Open0614.05039MaRDI QIDQ4722101FDOQ4722101

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

Publication date: 1986

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

algorithmhypergraphminimal realizationstrict realization

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• On constructing the minimal realizations of hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Realization of hypergraphs by trees of minimal diameter
• Title not available (Why is that?)
• Hypergraph edge representations with the use of homological paths
• Title not available (Why is that?)
• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
• Title not available (Why is that?)

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)