On null 3-hypergraphs

DOI10.1016/J.DAM.2020.10.020zbMATH Open1472.05129OpenAlexW3113156594MaRDI QIDQ1983115FDOQ1983115

Authors: G. Palma, Lama Tarsissi, Andrea Frosini, William Kocay 

Publication date: 15 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.10.020

Recommendations

• Structure and complexity of 2-intersection graphs of 3-hypergraphs
• Some NP-complete problems for hypergraph degree sequences
• scientific article; zbMATH DE number 4101253
• Hypergraphic degree sequences are hard
• On 3-hypergraphs with equal degree sequences.

zbMATH Keywords

NP-completenessself-complementary3-hypergraphnull hypergraphnull labelling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A remark on the existence of finite graphs
• A note on non-reconstructible 3-hypergraphs
• Title not available (Why is that?)
• 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
• Optimization over degree sequences

Cited In (4)

• New sufficient conditions on the degree sequences of uniform hypergraphs
• A study on the existence of null labelling for 3-hypergraphs
• Separable and equatable hypergraphs
• Structure and complexity of 2-intersection graphs of 3-hypergraphs

Uses Software

• Groups & Graphs

This page was built for publication: On null 3-hypergraphs

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