MAXIMUM INDUCED TREES IN GRAPHS

被引：77
|
作者：
ERDOS, P
SAKS, M
SOS, VT
机构：
[1] RUTGERS STATE UNIV,DEPT MATH,NEW BRUNSWICK,NJ 08903
[2] AT&T BELL LABS,MURRAY HILL,NJ 07974
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 1986年 / 41卷 / 01期
关键词：
D O I：
10.1016/0095-8956(86)90028-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：61 / 79
页数：19
相关论文
共 50 条
  • [21] On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
    Lonc, Z
    Parol, K
    Wojciechowski, JM
    NETWORKS, 1997, 30 (01) : 47 - 56
  • [22] A greedy algorithm for finding maximum spanning trees in infinite graphs
    Thomas Ryan, Christopher
    Smith, Robert L.
    OPERATIONS RESEARCH LETTERS, 2022, 50 (06) : 655 - 659
  • [23] Maximum properly colored trees in edge-colored graphs
    Jie Hu
    Hao Li
    Shun-ichi Maezawa
    Journal of Combinatorial Optimization, 2022, 44 : 154 - 171
  • [24] The Sombor index of trees and unicyclic graphs with given maximum degree
    Zhou, Ting
    Lin, Zhen
    Miao, Lianying
    DISCRETE MATHEMATICS LETTERS, 2021, 7 : 24 - 29
  • [25] Approximation algorithms for maximum weighted internal spanning trees in regular graphs and subdivisions of graphs
    Hakim, Sheikh Azizul
    Nishat, Rahnuma Islam
    Rahman, Md Saidur
    COMPUTER JOURNAL, 2024, 67 (10): : 2898 - 2905
  • [26] Maximum Induced Forests of Product Graphs
    Wang, Tao
    Wu, Baoyindureng
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2023, 46 (01)
  • [27] Maximum induced forests in random graphs
    Krivoshapko, M.
    Zhukovskii, M.
    DISCRETE APPLIED MATHEMATICS, 2021, 305 : 211 - 213
  • [28] Maximum Induced Matching of Hexagonal Graphs
    Rija Erveš
    Petra Šparl
    Bulletin of the Malaysian Mathematical Sciences Society, 2016, 39 : 283 - 295
  • [29] Maximum Induced Matching of Hexagonal Graphs
    Erves, Rija
    Sparl, Petra
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2016, 39 : S283 - S295
  • [30] On maximum induced matchings in bipartite graphs
    Lozin, VV
    INFORMATION PROCESSING LETTERS, 2002, 81 (01) : 7 - 11
12345