Reconstructing 2-complexes by a nonnegative integer-valued vector
From MaRDI portal
Publication:2392636
DOI10.1134/S0005117911120095zbMATH Open1269.05085OpenAlexW2048756138MaRDI QIDQ2392636FDOQ2392636
Authors: A. V. Mokryakov, V. I. Tsurkov
Publication date: 2 August 2013
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117911120095
Recommendations
- Hypergraphs as algebraic structures
- Hypergraph recovery algorithms from a given vector of vertex degrees
- On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
- About realization of integer non-negative numbers tuple into 2-dimensional complexes
- A family of non-reconstructible hypergraphs
Applications of graph theory (05C90) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65)
Cites Work
Cited In (8)
- First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees
- Hypergraph recovery algorithms from a given vector of vertex degrees
- Hypergraphs as algebraic structures
- Signatures of extremal 2-unifrom hypergraphs
- Packing circular-like objects in a rectangular container
- Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs
- Algorithm of multidimensional data transmission using extremal uniform hypergraphs
- About realization of integer non-negative numbers tuple into 2-dimensional complexes
This page was built for publication: Reconstructing 2-complexes by a nonnegative integer-valued vector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392636)