Spanning Trees with At Most 6 Leaves in - Free Graphs

Pei Sun and Kai Liu

Mathematical Problems in Engineering, 2019, vol. 2019, 1-11

Abstract:

A graph G is called - free if G contains no as an induced subgraph. A tree with at most m leaves is called an m -ended tree. Let be the minimum degree sum of k independent vertices in G . In this paper, it is shown that every connected - free graph G contains a spanning 6-ended tree if .

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2019/1348348.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2019/1348348.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:1348348

DOI: 10.1155/2019/1348348

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().