Degree Sequences in Complexes and Hypergraphs

DOI10.2307/2040049zbMath0323.05137OpenAlexW4248977267MaRDI QIDQ4085762

A. K. Dewdney

Publication date: 1975

Full work available at URL: https://doi.org/10.2307/2040049

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Graph theory (05C99)

Related Items

New sufficient conditions on the degree sequences of uniform hypergraphs, 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, On connectivity of triangulations of manifolds, Structure and complexity of 2-intersection graphs of 3-hypergraphs, Unnamed Item, On null 3-hypergraphs, Properties of unique degree sequences of 3-uniform hypergraphs, On the reconstruction of 3-uniform hypergraphs from step-two degree sequences, 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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