A study on the existence of null labelling for 3-hypergraphs

DOI10.1007/978-3-030-79987-8_20OpenAlexW3176258965MaRDI QIDQ2115865

Niccolò Di Marco, William L. Kocay, Andrea Frosini

Publication date: 22 March 2022

Full work available at URL: http://hdl.handle.net/2158/1242518

zbMATH Keywords

Hamiltonian cyclediscrete tomography3-hypergraphnull labelling

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

The generalized microscopic image reconstruction problem for hypergraphs ⋮ Structure and complexity of 2-intersection graphs of 3-hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on non-reconstructible 3-hypergraphs
• New results on degree sequences of uniform hypergraphs
• New sufficient conditions on the degree sequences of uniform hypergraphs
• Some NP-complete problems for hypergraph degree sequences
• Discrete tomography. Foundations, algorithms, and applications
• On null 3-hypergraphs
• Degree Sequences in Complexes and Hypergraphs
• Optimization over Degree Sequences
• On the Degree Sequences of Uniform Hypergraphs
• The Two-Triangle Case of the Acquaintance Graph
• A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences

This page was built for publication: A study on the existence of null labelling for 3-hypergraphs