Structure and complexity of 2-intersection graphs of 3-hypergraphs

DOI10.1007/S00453-022-00990-4MaRDI QIDQ2689256zbMATH OpenOpenAlexFDO

Authors Niccolò Di Marco, Lama Tarsissi, Andrea Frosini, William Kocay, E. Pergola

Publication date 9 March 2023

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00453-022-00990-4

zbMATH Keywords

NP-completenessreconstruction problem3-hypergraphnull labelling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On null 3-hypergraphs
• Intersection multigraphs of uniform hypergraphs
• Recognizing intersection graphs of linear uniform hypergraphs
• 3-Colorability of plane hypergraphs
• A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs

Cites work

• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• A study on the existence of null labelling for 3-hypergraphs
• A tomographical interpretation of a sufficient condition on \(h\)-graphical sequences
• Degree Sequences in Complexes and Hypergraphs
• New results on degree sequences of uniform hypergraphs
• New sufficient conditions on the degree sequences of uniform hypergraphs
• On 3-hypergraphs with equal degree sequences.
• On null 3-hypergraphs
• On the degree sequences of uniform hypergraphs
• Optimization over degree sequences

Cited in

(5)

• scientific article; zbMATH DE number 5777931 (Why is no real title available?)
• On null 3-hypergraphs
• scientific article; zbMATH DE number 6503350 (Why is no real title available?)
• The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs
• A note on the pancyclism of block intersection graphs for universal friendship hypergraphs

This page was built for publication: Structure and complexity of 2-intersection graphs of 3-hypergraphs

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