Maximum spread of Ks,t-minor-free graphs

被引：0
|
作者：
Linz, William [1 ]
Lu, Linyuan [1 ]
Wang, Zhiyu [2 ]
机构：
[1] University of South Carolina, Columbia,SC, United States
[2] Louisiana State University, Baton Rouge,LA, United States
来源：
arXiv | 2024年
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Eigenvalues and eigenfunctions
引用
收藏
相关论文
共 50 条
  • [41] Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor
    Dvorak, Zdenek
    Lahiri, Abhiruk
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2023, 2023, 14093 : 291 - 304
  • [42] On Ks,t-minors in graphs with given average degree
    Kostochka, Alexandr
    Prince, Noah
    DISCRETE MATHEMATICS, 2008, 308 (19) : 4435 - 4445
  • [43] Maximum number of edges of (rKt)-free graphs
    Sun, Liang
    Yang, Gang
    Journal of Beijing Institute of Technology (English Edition), 1997, 6 (01): : 9 - 13
  • [44] Maximum Cuts in H-Free Graphs
    Ma, Huawen
    GRAPHS AND COMBINATORICS, 2020, 36 (05) : 1503 - 1516
  • [45] Strong-Diameter Decompositions of Minor Free Graphs
    Ittai Abraham
    Cyril Gavoille
    Dahlia Malkhi
    Udi Wieder
    Theory of Computing Systems, 2010, 47 : 837 - 855
  • [46] Flows in one-crossing-minor-free graphs
    1600, Brown University (17):
  • [47] Neighbor Sum Distinguishing Index of -Minor Free Graphs
    Zhang, Jianghua
    Ding, Laihao
    Wang, Guanghui
    Yan, Guiying
    Zhou, Shan
    GRAPHS AND COMBINATORICS, 2016, 32 (04) : 1621 - 1633
  • [48] A PTAS for subset TSP in minor-free graphs
    Le, Hung
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2279 - 2298
  • [49] Choosability of K5-minor-free graphs
    Skrekovski, R
    DISCRETE MATHEMATICS, 1998, 190 (1-3) : 223 - 226
  • [50] Flows in One-Crossing-Minor-Free Graphs
    Chambers, Erin
    Eppstein, David
    ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 241 - +
12345