Pages that link to "Item:Q1076694"
From MaRDI portal
The following pages link to Some NP-complete problems for hypergraph degree sequences (Q1076694):
Displaying 23 items.
- Some approaches for solving the general (\(t,k\))-design existence problem and other related problems (Q385139) (← links)
- Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs (Q389497) (← links)
- New results on degree sequences of uniform hypergraphs (Q396927) (← links)
- On graphic and 3-hypergraphic sequences (Q809101) (← links)
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard (Q957360) (← links)
- Numerical characterization of \(n\)-cube subset partitioning (Q1026122) (← links)
- Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems (Q1199123) (← links)
- The polytope of degree sequences of hypergraphs (Q1611881) (← links)
- On null 3-hypergraphs (Q1983115) (← links)
- Properties of unique degree sequences of 3-uniform hypergraphs (Q2061813) (← links)
- On the reconstruction of 3-uniform hypergraphs from step-two degree sequences (Q2061815) (← links)
- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays (Q2106608) (← links)
- A study on the existence of null labelling for 3-hypergraphs (Q2115865) (← links)
- More non-reconstructible hypergraphs (Q2277489) (← links)
- Essential points of the \(n\)-cube subset partitioning characterisation (Q2434737) (← links)
- Polynomial recognition of equal unions in hypergraphs with few vertices of large degree (Q2458923) (← links)
- Optimization over degree sequences of graphs (Q2663988) (← links)
- On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two (Q2678917) (← links)
- (Q3826607) (← links)
- Optimization over Degree Sequences (Q4579955) (← links)
- NP-completeness of some optimal sequencing problems with a given grouping of elements (Q4723552) (← links)
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition (Q5237060) (← links)
- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) (← links)