A Note on Unigraphic Sequences
From MaRDI portal
Publication:4083706
DOI10.1002/SAPM1975544283zbMATH Open0321.05127OpenAlexW15164188MaRDI QIDQ4083706FDOQ4083706
Author name not available (Why is that?)
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
Cited In (13)
- Win-win kernelization for degree sequence completion problems
- Split graphs
- Title not available (Why is that?)
- 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)
