The following pages link to (Q3207000):
Displaying 12 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Hereditary unigraphs and Erdős-Gallai equalities (Q389468) (← links)
- Once more on matrogenic graphs (Q797598) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- The network flows approach for matrices with given row and column sums (Q1052337) (← links)
- Adjacency relationships forced by a degree sequence (Q1756108) (← links)
- On forcibly hereditary P-graphical sequences (Q1820175) (← links)
- The principal Erdős-Gallai differences of a degree sequence (Q2075508) (← links)
- Equistable graphs, general partition graphs, triangle graphs, and graph products (Q2275915) (← links)
- Minimal forbidden sets for degree sequence characterizations (Q2344782) (← links)
- Neighborhood degree lists of graphs (Q2411614) (← links)
- Graphs and degree sequences. I (Q3803156) (← links)
