On embedding degree sequences
classification
🧮 math.CO
keywords
graphsequencessimpleassumeconditionsconsiderdegreeembedding
read the original abstract
Assume that we are given two graphic sequences, $\pi_1$ and $\pi_2$. We consider conditions for $\pi_1$ and $\pi_2$ which guarantee that there exists a simple graph $G_2$ realizing $\pi_2$ such that $G_2$ is the subgraph of any simple graph $G_1$ that realizes $\pi_1$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.