Excluding Degree Sequences of Cycles

2011/10/18 by Christian Joseph Altomare, Altomare, Christian Joseph
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Formal Methods in Verification #math.CO

paper · pdf · doi:10.48550/arxiv.1110.4145

7 pages

arxiv created 2011/10/18 · openalex publication_date 2011/10/18 · arxiv updated 2011/10/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we characterize the degree sequences excluding the degree sequence of a square in terms of forcibly chordal graphs, and we prove several related results.

Related

• Bounding the number of cycles in a graph in terms of its degree sequence
• On connected degree sequences
• Infinite graphs that do not contain cycles of length four
• Forcibly unicyclic and bicyclic graphic sequences
• On Chordal Graph and Line Graph Squares