On odd covers of cliques and disjoint unions

Ähnliche Einträge

• A lower bound on the saturation number and a strengthening for triangle-free graphs
  von: Buchanan, Calum, et al.
  Veröffentlicht: (2024)
• Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
  von: Gao, Yongbin, et al.
  Veröffentlicht: (2026)
• Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs
  von: Wu, Jiancheng, et al.
  Veröffentlicht: (2025)
• Sufficient conditions for a graph with minimum degree to be k-critical with respect to [1,b]-odd factor
  von: Zhou, Sizhong
  Veröffentlicht: (2025)
• Aα-spectral radius and path-factor covered graphs
  von: Zhou, Sizhong, et al.
  Veröffentlicht: (2024)