"Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable."

Xiangwen Li, Jie Liu, Jian-Bo Lv (2023)

> Home

Details and statistics

DOI: 10.1007/S00373-023-02713-0

access: closed

type: Journal Article

metadata version: 2023-11-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/LiLL23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/LiLL23
Xiangwen Li, Jie Liu, Jian-Bo Lv:
Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable. Graphs Comb. 39(6): 118 (2023)

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.