On graphic and 3-hypergraphic sequences

DOI10.1016/0012-365X(91)90076-EzbMATH Open0732.05053WikidataQ127124988 ScholiaQ127124988MaRDI QIDQ809101FDOQ809101

Authors: S. A. Choudum 

Publication date: 1991

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 553900
• Some NP-complete problems for hypergraph degree sequences
• Hypergraphic degree sequences are hard
• scientific article; zbMATH DE number 4200248
• An efficiently recognisable subset of hypergraphic sequences

zbMATH Keywords

n-hypergraphic graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some NP-complete problems for hypergraph degree sequences
• Personal reminiscences and remarks on the mathematical work of Tibor Gallai
• Degree Sequences in Complexes and Hypergraphs
• Conditions for sequences to be r-graphic

Cited In (7)

• New results on degree sequences of uniform hypergraphs
• Hypergraphic degree sequences are hard
• The polytope of degree sequences of hypergraphs
• Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
• Title not available (Why is that?)
• An efficiently recognisable subset of hypergraphic sequences
• Title not available (Why is that?)

This page was built for publication: On graphic and 3-hypergraphic sequences

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