On Potentially (K₅-C₄)-graphic Sequences

2006/12/31 by Lili Hu, Hu, Lili, Chunhui Lai +1
Computer Science · Mathematics · #05C07 #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #FOS: Mathematics #Medical Image Segmentation Techniques #math.CO #msc:05C07

paper · pdf · doi:10.48550/arxiv.math/0701023

18 pages

arxiv created 2006/12/31 · openalex publication_date 2006/12/31 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we characterize the potentially (K₅-C₄)-graphic sequences where K₅-C₄ is the graph obtained from K₅ by removing four edges of a 4 cycle C₄. This characterization implies a theorem due to Lai [6].

Related

• A Characterization On Potentially K₆-C₄-graphic Sequences
• On potentially K₆-C₅ graphic sequences
• A Characterization On Potentially K_2,5-graphic Sequences
• On Potentially K₅-E₃-graphic Sequences
• A note on potentially K₄-e graphical sequences