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

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

Authors: Niccolò Di Marco, Andrea Frosini, William Kocay 

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)

Cites Work

• The Two-Triangle Case of the Acquaintance Graph
• Discrete tomography. Foundations, algorithms, and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on non-reconstructible 3-hypergraphs
• Some NP-complete problems for hypergraph degree sequences
• Degree Sequences in Complexes and Hypergraphs
• New results on degree sequences of uniform hypergraphs
• On 3-hypergraphs with equal degree sequences.
• A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences
• On null 3-hypergraphs
• Optimization over Degree Sequences
• On the degree sequences of uniform hypergraphs
• New sufficient conditions on the degree sequences of uniform hypergraphs

Cited In (3)

• A note on the pancyclism of block intersection graphs for universal friendship hypergraphs
• Structure and complexity of 2-intersection graphs of 3-hypergraphs
• The generalized microscopic image reconstruction problem for hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115865)