Degree-equipartite graphs

Khodakhast Bibak, Mohammad Hassan Shirdareh Haghighi

A graph $G$ of order $2n$ is called degree-equipartite if for every $n$-element set $A\subseteq V(G)$, the degree sequences of the induced subgraphs $G[A]$ and $G[V(G)\setminus A]$…