"Every planar graph without triangles adjacent to cycles of length 3 or 6 ..."

Ziwen Huang (2020)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2020.111846

access: closed

type: Journal Article

metadata version: 2020-07-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/Huang20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Huang20
Ziwen Huang:
Every planar graph without triangles adjacent to cycles of length 3 or 6 is (1, 1, 1)-colorable. Discret. Math. 343(6): 111846 (2020)

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.