Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Every signed planar graph without cycles of length from 4 to 8 is 3-colorable."

Lili Hu, Xiangwen Li (2018)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2017.09.019

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/HuL18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/HuL18
Lili Hu, Xiangwen Li:
Every signed planar graph without cycles of length from 4 to 8 is 3-colorable. Discret. Math. 341(2): 513-519 (2018)

a service of

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.