On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
From MaRDI portal
Publication:5237060
DOI10.1007/978-3-030-14085-4_16OpenAlexW2917911035MaRDI QIDQ5237060
Andrea Frosini, Christophe Picouleau
Publication date: 16 October 2019
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-14085-4_16
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New results on degree sequences of uniform hypergraphs
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
- A reconstruction algorithm for a subclass of instances of the 2-color problem
- A theorem on flows in networks
- A simple criterion on degree sequences of graphs
- Some NP-complete problems for hypergraph degree sequences
- Discrete tomography. Foundations, algorithms, and applications
- The lattice of integer partitions
- A solvable case of image reconstruction in discrete tomography
- Using graphs for some discrete tomography problems
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
- Solving the Two Color Problem: An Heuristic Algorithm
- Combinatorial Properties of Matrices of Zeros and Ones
- Degree-constrained edge partitioning in graphs arising from discrete tomography
- Solving Some Instances of the 2-Color Problem
- The 1-Color Problem and the Brylawski Model
- Seven criteria for integer sequences being graphic
- Degree Sequences in Complexes and Hypergraphs
- Optimization over Degree Sequences
- On the Degree Sequences of Uniform Hypergraphs
- A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences
