"Proof of a conjecture on connectivity keeping odd paths in k-connected ..."

Qing Yang, Yingzhi Tian (2025)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2025.114476

access: closed

type: Journal Article

metadata version: 2025-03-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/YangT25a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/YangT25a
Qing Yang, Yingzhi Tian:
Proof of a conjecture on connectivity keeping odd paths in k-connected bipartite graphs. Discret. Math. 348(8): 114476 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.