"Every planar graph without 4-cycles adjacent to two triangles is ..."

Runrun Liu, Xiangwen Li (2019)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2018.10.025

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/LiuL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/LiuL19
Runrun Liu, Xiangwen Li:
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable. Discret. Math. 342(3): 623-627 (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.