On potentially K6-C5 graphic sequences
Abstract
For given a graph H, a graphic sequence π=(d1,d2,...,dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. In this paper, we characterize the potentially K6-C5 -graphic sequences.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.