Spanning trees with small degrees and few leaves

被引：3
|
作者：
Rivera-Campo, Eduardo [1 ]
机构：
[1] Univ Autonoma Metropolitana Iztapalapa, Dept Matemat, Mexico City 09340, DF, Mexico
来源：
APPLIED MATHEMATICS LETTERS | 2012年 / 25卷 / 10期
关键词：
Spanning tree; Bounded degree; Few leaves;
D O I：
10.1016/j.aml.2011.12.021
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We give an Ore-type condition sufficient for a graph G to have a spanning tree with small degrees and with few leaves. (c) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码：1444 / 1446
页数：3
相关论文
共 50 条
  • [1] Spanning Trees with Few Leaves
    Masao Tsugaki
    Tomoki Yamashita
    Graphs and Combinatorics, 2007, 23 : 585 - 598
  • [2] Spanning trees with few leaves
    Tsugaki, Masao
    Yamashita, Tomoki
    GRAPHS AND COMBINATORICS, 2007, 23 (05) : 585 - 598
  • [3] On finding spanning trees with few leaves
    Salamon, Gabor
    Wiener, Gabor
    INFORMATION PROCESSING LETTERS, 2008, 105 (05) : 164 - 169
  • [4] Spanning trees with bounded degrees and leaves
    Kano, Mikio
    Yan, Zheng
    DISCRETE MATHEMATICS, 2016, 339 (05) : 1583 - 1586
  • [5] SPANNING TREES WITH FEW NON-LEAVES
    Alon, Noga
    ISRAEL JOURNAL OF MATHEMATICS, 2023, 256 (01) : 9 - 20
  • [6] Spanning trees and spanning closed walks with small degrees
    Hasanvand, Morteza
    DISCRETE MATHEMATICS, 2022, 345 (10)
  • [7] Spanning trees and spanning Eulerian subgraphs with small degrees
    Hasanvand, Morteza
    DISCRETE MATHEMATICS, 2015, 338 (08) : 1317 - 1321
  • [8] Spanning trees whose stems have a few leaves
    Tsugaki, Masao
    Zhang, Yao
    ARS COMBINATORIA, 2014, 114 : 245 - 256
  • [9] Heavy cycles and spanning trees with few leaves in weighted graphs
    Li, Binlong
    Zhang, Shenggui
    APPLIED MATHEMATICS LETTERS, 2011, 24 (06) : 908 - 910
  • [10] Spanning Trees with Few Leaves in Almost Claw-Free Graphs
    Xiaodong CHEN
    Mingchu LI
    Meijin XU
    JournalofMathematicalResearchwithApplications, 2016, 36 (04) : 450 - 456
12345