"Nonseparating trees in 2-connected graphs and oriented trees in strongly ..."

Yingzhi Tian et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2018.10.001

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/TianLXM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/TianLXM19
Yingzhi Tian, Hong-Jian Lai, Liqiong Xu, Jixiang Meng:
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. Discret. Math. 342(2): 344-351 (2019)

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.