default search action

combined dblp search
author search
venue search
publication search

ask others

"Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 ..."

Xiaodong Chen et al. (2025)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2024.08.020

access: closed

type: Journal Article

metadata version: 2024-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/ChenZXS25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/ChenZXS25
Xiaodong Chen, Jiayuan Zhang, Liming Xiong, Guifu Su:
Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 contains two CISTs. Discret. Appl. Math. 360: 51-64 (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.