Balanced Spanning Caterpillars

2017/11/29 by Andrzej Czygrinow, Czygrinow, Andrzej, Jangwon Yie +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1711.10990

openalex publication_date 2017/11/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A p-caterpillar is a caterpillar such that every non-leaf vertex is adjacent to exactly p leaves. We give a tight minimum degree condition for a graph to have a spanning p-caterpillar.

Citations

• Some Theorems on Abstract Graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

Related

• On the relation between connectivity, independence and generalized caterpillars
• Embedding perfectly balanced 2-caterpillar into its optimal hypercube
• k-planar Placement and Packing of Δ-regular Caterpillars
• Caterpillars in Erdős-Hajnal
• Caterpillars with n vertices are reconstructible from subgraphs with at most n/2+1 vertices