A Note on Unigraphic Sequences
From MaRDI portal
Cited in
(14)- Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences
- On forcibly hereditary P-graphical sequences
- Split graphs
- The principal Erdős-Gallai differences of a degree sequence
- Win-win kernelization for degree sequence completion problems
- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
- Graphs and degree sequences. I
- H-product of graphs, H-threshold graphs and threshold-width of graphs
- Hereditary unigraphs and Erdős-Gallai equalities
- scientific article; zbMATH DE number 6963897 (Why is no real title available?)
- Non-minimal degree-sequence-forcing triples
- Graph classes characterized both by forbidden subgraphs and degree sequences
- Forcibly bipartite and acyclic (uni-)graphic sequences
- The hereditary closure of the unigraphs
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)