The edge-count criterion for graphic lists

MaRDI QIDQ612910zbMATH OpenFDO

Authors Garth Isaak, Douglas B. West

Publication date 16 December 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/231160, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1n36.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

signed graphsdegree listgraphic list

Mathematics Subject Classification ID

Vertex degrees (05C07) Signed and weighted graphs (05C22)

Recommendations

• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• Seven criteria for integer sequences being graphic
• Degree sequences in graphs
• Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
• Constructive extensions of two results on graphic sequences

Cited in

(1)

• Graphic and protographic lists of integers

This page was built for publication: The edge-count criterion for graphic lists

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