A Note on Unigraphic Sequences

DOI10.1002/SAPM1975544283MaRDI QIDQ4083706zbMATH OpenOpenAlexFDO

Authors

Publication date 1975

Published in Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/sapm1975544283

Mathematics Subject Classification ID

Graph theory (05C99)

Cited in

(13)

• Win-win kernelization for degree sequence completion problems
• Split graphs
• scientific article; zbMATH DE number 6963897 (Why is no real title available?)
• Hereditary unigraphs and Erdős-Gallai equalities
• Graphs and degree sequences. I
• The principal Erdős-Gallai differences of a degree sequence
• Graph classes characterized both by forbidden subgraphs and degree sequences
• Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences
• On forcibly hereditary P-graphical sequences
• Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
• Forcibly bipartite and acyclic (uni-)graphic sequences
• H-product of graphs, H-threshold graphs and threshold-width of graphs
• Non-minimal degree-sequence-forcing triples

This page was built for publication: A Note on Unigraphic Sequences

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