Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs

Documenti analoghi

• Connectivity keeping trees in 3-connected bipartite graphs with girth conditions
  di: Yang, Qing, et al.
  Pubblicazione: (2023)
• Connectivity keeping paths for k-connected bipartite graphs
  di: Ji, Meng
  Pubblicazione: (2023)
• The 3-restricted edge-connectivity of the direct product graphs
  di: Wang, Wenxin, et al.
  Pubblicazione: (2025)
• $k$-path graphs: experiments and conjectures about algebraic connectivity and $α$-index
  di: de Paula, Rafael L., et al.
  Pubblicazione: (2025)
• Monochromatic $k$-connection of graphs
  di: Cai, Qingqiong, et al.
  Pubblicazione: (2024)