无爪图的可约干少叶生成树

IF 0.4 4区数学 Q4 MATHEMATICS

Studia Scientiarum Mathematicarum Hungarica Pub Date : 2021-12-08 DOI:10.1556/012.2023.01538

P. Ha

{"title":"无爪图的可约干少叶生成树","authors":"P. Ha","doi":"10.1556/012.2023.01538","DOIUrl":null,"url":null,"abstract":"Let T be a tree. The reducible stem of T is the smallest subtree that contains all branch vertices of T. In this paper, we first use a new technique of Gould and Shull [5] to state a new short proof for a result of Kano et al. [10] on the spanning tree with a bounded number of leaves in a claw-free graph. After that, we use a similar idea to prove a sharp sufficient condition for a claw-free graph having a spanning tree whose reducible stem has few leaves.","PeriodicalId":51187,"journal":{"name":"Studia Scientiarum Mathematicarum Hungarica","volume":"46 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2021-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Spanning Trees of a Claw-Free Graph Whose Reducible Stems Have Few Leaves\",\"authors\":\"P. Ha\",\"doi\":\"10.1556/012.2023.01538\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let T be a tree. The reducible stem of T is the smallest subtree that contains all branch vertices of T. In this paper, we first use a new technique of Gould and Shull [5] to state a new short proof for a result of Kano et al. [10] on the spanning tree with a bounded number of leaves in a claw-free graph. After that, we use a similar idea to prove a sharp sufficient condition for a claw-free graph having a spanning tree whose reducible stem has few leaves.\",\"PeriodicalId\":51187,\"journal\":{\"name\":\"Studia Scientiarum Mathematicarum Hungarica\",\"volume\":\"46 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2021-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Studia Scientiarum Mathematicarum Hungarica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1556/012.2023.01538\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Studia Scientiarum Mathematicarum Hungarica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1556/012.2023.01538","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 2

摘要

让我成为一棵树。T的可约干是包含T的所有分支顶点的最小子树。本文首先利用Gould和Shull[5]的新技术，在无爪图的有界叶生成树上对Kano等人[10]的结果给出了一个新的简短证明。然后，我们用类似的思想证明了一个无爪图的一个尖锐的充分条件，该无爪图具有一个生成树，其可约茎有几个叶。

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

查看原文本刊更多论文

Spanning Trees of a Claw-Free Graph Whose Reducible Stems Have Few Leaves

Let T be a tree. The reducible stem of T is the smallest subtree that contains all branch vertices of T. In this paper, we first use a new technique of Gould and Shull [5] to state a new short proof for a result of Kano et al. [10] on the spanning tree with a bounded number of leaves in a claw-free graph. After that, we use a similar idea to prove a sharp sufficient condition for a claw-free graph having a spanning tree whose reducible stem has few leaves.

求助全文

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

来源期刊

Studia Scientiarum Mathematicarum Hungarica 数学-数学

CiteScore

1.30

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The journal publishes original research papers on various fields of mathematics, e.g., algebra, algebraic geometry, analysis, combinatorics, dynamical systems, geometry, mathematical logic, mathematical statistics, number theory, probability theory, set theory, statistical physics and topology.