default search action

combined dblp search
author search
venue search
publication search

ask others

"Every 3-connected claw-free graph with domination number at most 3 is ..."

Petr Vrána, Xingzhi Zhan, Leilei Zhang (2022)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2022.112909

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/VranaZZ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/VranaZZ22
Petr Vrána, Xingzhi Zhan, Leilei Zhang:
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. Discret. Math. 345(8): 112909 (2022)

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.