The following pages link to A Note on Unigraphic Sequences (Q4083706):
Displaying 13 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs (Q389453) (← links)
- Hereditary unigraphs and Erdős-Gallai equalities (Q389468) (← links)
- Non-minimal degree-sequence-forcing triples (Q497308) (← links)
- Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences (Q1050376) (← links)
- On forcibly hereditary P-graphical sequences (Q1820175) (← links)
- Split graphs (Q1873776) (← links)
- The principal Erdős-Gallai differences of a degree sequence (Q2075508) (← links)
- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) (Q3605495) (← links)
- Graphs and degree sequences. I (Q3803156) (← links)
- (Q4691781) (← links)
- Graph classes characterized both by forbidden subgraphs and degree sequences (Q5441407) (← links)
- Forcibly bipartite and acyclic (uni-)graphic sequences (Q6041871) (← links)
