"Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, ..."

Xiangwen Li, Yuxue Yin, Gexin Yu (2020)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2019.111661

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/LiYY20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/LiYY20
Xiangwen Li, Yuxue Yin, Gexin Yu:
Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable. Discret. Math. 343(2): 111661 (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.