"Every planar graph without 3-cycles adjacent to 4-cycles and without ..."

Ying Bai, Xiangwen Li, Gexin Yu (2017)

> Home

Details and statistics

DOI: 10.1007/S10878-016-0039-3

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/BaiLY17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/BaiLY17
Ying Bai, Xiangwen Li, Gexin Yu:
Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable. J. Comb. Optim. 33(4): 1354-1364 (2017)

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.