无$$K_{1,4}$$图的生成树，其可还原茎的叶子很少

Pub Date : 2024-02-19 DOI:10.1007/s10998-024-00572-7

Pham Hoang Ha, Le Dinh Nam, Ngoc Diep Pham

{"title":"无$$K_{1,4}$$图的生成树，其可还原茎的叶子很少","authors":"Pham Hoang Ha, Le Dinh Nam, Ngoc Diep Pham","doi":"10.1007/s10998-024-00572-7","DOIUrl":null,"url":null,"abstract":"Let T be a tree; a vertex of degree 1 is a leaf of T and a vertex of degree at least 3 is a branch vertex of T. The reducible stem of T is the smallest subtree that contains all branch vertices of T. In this paper, we give some sharp sufficient conditions for \$K_{1,4}\$-free graphs to have a spanning tree whose reducible stem has few leaves.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Spanning trees of $$K_{1,4}$$ -free graphs whose reducible stems have few leaves\",\"authors\":\"Pham Hoang Ha, Le Dinh Nam, Ngoc Diep Pham\",\"doi\":\"10.1007/s10998-024-00572-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let T be a tree; a vertex of degree 1 is a leaf of T and a vertex of degree at least 3 is a branch vertex of T. The reducible stem of T is the smallest subtree that contains all branch vertices of T. In this paper, we give some sharp sufficient conditions for \\\$K_{1,4}\\\$-free graphs to have a spanning tree whose reducible stem has few leaves.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-02-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10998-024-00572-7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10998-024-00572-7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

让 T 是一棵树；度数为 1 的顶点是 T 的叶子，度数至少为 3 的顶点是 T 的分支顶点。T 的可还原干是包含 T 所有分支顶点的最小子树。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

$Spanning trees of $$K_{1,4}$$ -free graphs whose reducible stems have few leaves$

查看原文

Spanning trees of $$K_{1,4}$$ -free graphs whose reducible stems have few leaves

Let T be a tree; a vertex of degree 1 is a leaf of T and a vertex of degree at least 3 is a branch vertex of T. The reducible stem of T is the smallest subtree that contains all branch vertices of T. In this paper, we give some sharp sufficient conditions for $K_{1,4}$-free graphs to have a spanning tree whose reducible stem has few leaves.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助