New sufficient conditions on the degree sequences of uniform hypergraphs

[1]  Levon Aslanyan,et al.  Discrete tomography with distinct rows: Relaxation , 2017, 2017 Computer Science and Information Technologies (CSIT).

[2]  Dominique de Werra,et al.  Using graphs for some discrete tomography problems , 2006, Discret. Appl. Math..

[3]  Hasmik Sahakyan.  Essential points of the n-cube subset partitioning characterisation , 2014, Discret. Appl. Math..

[4]  E. Gilbert,et al.  Symmetry types of periodic sequences , 1961 .

[5]  Stephen G. Hartke,et al.  New Results on Degree Sequences of Uniform Hypergraphs , 2013, Electron. J. Comb..

[6]  H. Ryser.  Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[7]  S. Brocchi.  Solving some instances of the two color problem. , 2009 .

[8]  Syed Mohammad Meesum,et al.  Optimization over Degree Sequences , 2017, SIAM J. Discret. Math..

[9]  Jian-Hua Yin,et al.  Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size , 2005, Discret. Math..

[10]  Stephen G. Hartke,et al.  Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps , 2012, Discret. Math..

[11]  Dominique de Werra,et al.  A solvable case of image reconstruction in discrete tomography , 2005, Discret. Appl. Math..

[12]  Han Hoogeveen,et al.  Seven criteria for integer sequences being graphic , 1991, J. Graph Theory.

[13]  Joe Sawada,et al.  A fast algorithm to generate necklaces with fixed content , 2003, Theor. Comput. Sci..

[14]  Martín Matamala,et al.  Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem , 2011, Discret. Appl. Math..

[15]  Frank Ruskey,et al.  An efficient algorithm for generating necklaces with fixed density , 1999, SODA '99.

[16]  Andrea Frosini,et al.  A reconstruction algorithm for a subclass of instances of the 2-color problem , 2011, Theor. Comput. Sci..

[17]  A. K. Dewdney.  Degree sequences in complexes and hypergraphs , 1975 .

[18]  Andrea Frosini,et al.  On null 3-hypergraphs , 2021, Discret. Appl. Math..

[19]  Andrea Frosini,et al.  The 1-Color Problem and the Brylawski Model , 2009, DGCI.

[20]  Andrea Frosini,et al.  A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences , 2016, DGCI.

[21]  Eberhard Triesch,et al.  Realizability and uniqueness in graphs , 1994, Discret. Math..

[22]  Dominique de Werra,et al.  Degree-constrained edge partitioning in graphs arising from discrete tomography , 2009, J. Graph Algorithms Appl..

[23]  Thomas Brylawski,et al.  The lattice of integer partitions , 1973, Discret. Math..