On potentially K₆-C₅ graphic sequences
classification
🧮 math.CO
keywords
graphicpotentiallysequencescharacterizecontainingexistsgivengraph
read the original abstract
For given a graph $H$, a graphic sequence $\pi=(d_1,d_2,...,d_n)$ is said to be potentially $H$-graphic if there exists a realization of $\pi$ containing $H$ as a subgraph. In this paper, we characterize the potentially $K_6-C_5$ -graphic sequences.
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.