Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Every planar graph with cycles of length neither 4 nor 5 is (1, 1, ..."

Lingji Xu, Zhengke Miao, Yingqian Wang (2014)

> Home

Details and statistics

DOI: 10.1007/S10878-012-9586-4

access: closed

type: Journal Article

metadata version: 2020-08-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/XuMW14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/XuMW14
Lingji Xu, Zhengke Miao, Yingqian Wang:
Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable. J. Comb. Optim. 28(4): 774-786 (2014)

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.