Graphic approximation of integer sequences

DOI10.1007/978-3-031-62166-6_13MaRDI QIDQ6915978zbMATH OpenFDO

Authors Brian D. Cloteaux

Publication date 15 October 2025

Full work available at URL https://doi.org/10.1007/978-3-031-62166-6_13

zbMATH Keywords

degree sequencegraph generationgraphic sequences

Mathematics Subject Classification ID

Vertex degrees (05C07) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• A short proof of Kundu's k-factor theorem
• Confirming two conjectures about the integer partitions
• Contributions to the theory of graphic sequences
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3720966 (Why is no real title available?)
• Linear-time certifying algorithms for near-graphical sequences
• Realizing Degree Sequences in Parallel
• Some methods applicable to identities and inequalities of symmetric algebraic functions of n letters.
• The lattice of integer partitions
• Threshold graphs and related topics

This page was built for publication: Graphic approximation of integer sequences

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