"Planar graphs without adjacent cycles of length at most five are (1, 1, 0) ..."

Chuanni Zhang, Yingqian Wang, Min Chen (2016)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2016.06.011

access: open

type: Journal Article

metadata version: 2022-05-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/ZhangWC16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/ZhangWC16
Chuanni Zhang, Yingqian Wang, Min Chen:
Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable. Discret. Math. 339(12): 3032-3042 (2016)

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.