Properties of unique degree sequences of 3-uniform hypergraphs

DOI10.1007/978-3-030-76657-3_22zbMath1487.05186OpenAlexW3161217605WikidataQ122655569 ScholiaQ122655569MaRDI QIDQ2061813

Michela Ascolese, Lama Tarsissi, Andrea Frosini, William L. Kocay

Publication date: 21 December 2021

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

zbMATH Keywords

hypergraphanalysis of algorithmsuniqueness problemgraphic sequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (1)

Characterization and reconstruction of hypergraphic pattern sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New results on degree sequences of uniform hypergraphs
• Some NP-complete problems for hypergraph degree sequences
• Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Degree Sequences in Complexes and Hypergraphs
• Optimization over Degree Sequences
• On the Degree Sequences of Uniform Hypergraphs
• A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences

This page was built for publication: Properties of unique degree sequences of 3-uniform hypergraphs