The edge-count criterion for graphic lists

zbMATH Open1204.05038MaRDI QIDQ612910FDOQ612910

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

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

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

zbMATH Keywords

signed graphsdegree listgraphic list

Mathematics Subject Classification ID

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

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)