2020年7月
On minimum leaf spanning trees and a criticality notion
DISCRETE MATHEMATICS
- ,
- ,
- 巻
- 343
- 号
- 7
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1016/j.disc.2020.111884
- 出版者・発行元
- ELSEVIER
The minimum leaf number of a connected non-hamiltonian graph G is the number of leaves of a spanning tree of G with the fewest leaves among all spanning trees of G. Based on this quantity, Wiener introduced leaf-stable and leaf-critical graphs, concepts which generalise hypotraceability and hypohamiltonicity. In this article, we present new methods to construct leaf-stable and leaf-critical graphs and study their properties. Furthermore, we improve several bounds related to these families of graphs. These extend previous results of Horton, Thomassen, and Wiener. (C) 2020 Elsevier B.V. All rights reserved.
- リンク情報
-
- DOI
- https://doi.org/10.1016/j.disc.2020.111884
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000532825100022&DestApp=WOS_CPL
- URL
- http://www.scopus.com/inward/record.url?eid=2-s2.0-85081212601&partnerID=MN8TOARS
- ID情報
-
- DOI : 10.1016/j.disc.2020.111884
- ISSN : 0012-365X
- eISSN : 1872-681X
- ORCIDのPut Code : 73728025
- SCOPUS ID : 85081212601
- Web of Science ID : WOS:000532825100022