A simple formulation of the Boesch-Harary theorem on 2-graphic lists

DOI10.17654/MS100060923zbMATH Open1440.05064OpenAlexW2524440071MaRDI QIDQ2963199FDOQ2963199

Authors: Mudin Simanihuruk 

Publication date: 10 February 2017

Published in: Far East Journal of Mathematical Sciences (FJMS) (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/10139.htm

Recommendations

• New results on degree sequences of uniform hypergraphs
• New sufficient conditions on the degree sequences of uniform hypergraphs
• On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
• A remark on degree sequences of multigraphs
• Constructive extensions of two results on graphic sequences

zbMATH Keywords

\(k\)-uniform hypergraph\(k\)-graphic lists2-graphic listsBoesch-Harary theorem

Mathematics Subject Classification ID

Vertex degrees (05C07) Hypergraphs (05C65)

Cited In (1)

• A short constructive proof of the Erdős-Gallai characterization of graphic lists

This page was built for publication: A simple formulation of the Boesch-Harary theorem on 2-graphic lists

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