Some NP-complete problems for hypergraph degree sequences
From MaRDI portal
Publication:1076694
DOI10.1016/0166-218X(86)90028-4zbMath0594.05051OpenAlexW1969063419MaRDI QIDQ1076694
Charles J. Colbourn, Douglas R. Stinson, William L. Kocay
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(86)90028-4
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Optimization over degree sequences of graphs, Optimization over Degree Sequences, Some approaches for solving the general (\(t,k\))-design existence problem and other related problems, Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs, New results on degree sequences of uniform hypergraphs, On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two, Essential points of the \(n\)-cube subset partitioning characterisation, Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems, More non-reconstructible hypergraphs, Properties of unique degree sequences of 3-uniform hypergraphs, On the reconstruction of 3-uniform hypergraphs from step-two degree sequences, Numerical characterization of \(n\)-cube subset partitioning, On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition, Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays, On graphic and 3-hypergraphic sequences, A study on the existence of null labelling for 3-hypergraphs, The polytope of degree sequences of hypergraphs
Cites Work
