"Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable."

Lili Song, Lei Sun (2017)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2017-10-12

- no documents available
- export record
  dblp key:
  - journals/arscom/SongS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/SongS17
Lili Song, Lei Sun:
Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable. Ars Comb. 135: 29-38 (2017)

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.