Optimal Degree Conditions for Spanning Subgraphs

被引:0
|
作者
Arizona State University [1 ]
机构
来源
|
关键词
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] A DEGREE CONDITION FOR SPANNING EULERIAN SUBGRAPHS
    CHEN, ZH
    JOURNAL OF GRAPH THEORY, 1993, 17 (01) : 5 - 21
  • [2] Weighted enumeration of spanning subgraphs with degree constraints
    Wagner, David G.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2009, 99 (02) : 347 - 357
  • [3] Toughness, minimum degree, and spanning cubic subgraphs
    Bauer, D
    Niessen, T
    Schmeichel, E
    JOURNAL OF GRAPH THEORY, 2004, 45 (02) : 119 - 141
  • [4] SPANNING EULERIAN SUBGRAPHS OF BOUNDED DEGREE IN TRIANGULATIONS
    GAO, ZC
    WORMALD, NC
    GRAPHS AND COMBINATORICS, 1994, 10 (02) : 123 - 131
  • [5] Approximating Bounded Degree Maximum Spanning Subgraphs
    Feng, Wangsen
    Ma, Hao
    Zhang, Bei
    Wang, Hanpin
    OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 83 - +
  • [6] Optimal spread for spanning subgraphs of Dirac hypergraphs
    Kelly, Tom
    Muyesser, Alp
    Pokrovskiy, Alexey
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 169 : 507 - 541
  • [7] On computing optimal temporal branchings and spanning subgraphs
    Bubboloni, Daniela
    Catalano, Costanza
    Marino, Andrea
    Silva, Ana
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2025, 148
  • [8] Almost-spanning subgraphs with bounded degree in dense graphs
    Ishigami, Y
    EUROPEAN JOURNAL OF COMBINATORICS, 2002, 23 (05) : 583 - 612
  • [9] Forbidden subgraphs restricting vertices of degree two in a spanning tree
    Furuya, Michitaka
    Tsuchiya, Shoichi
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (03):
  • [10] On 2-connected spanning subgraphs with low maximum degree
    Sanders, DP
    Zhao, Y
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 74 (01) : 64 - 86