"Every 3-connected {K1,3,Γ3}-free graph is Hamilton-connected."

Adam Kabela et al. (2025)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2024.114305

access: closed

type: Journal Article

metadata version: 2024-11-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/KabelaRSV25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/KabelaRSV25
Adam Kabela, Zdenek Ryjácek, Mária Skyvová, Petr Vrána:
Every 3-connected {K1,3,Γ3}-free graph is Hamilton-connected. Discret. Math. 348(2): 114305 (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.