"Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths ..."

Hajo Broersma et al. (2006)

> Home

Details and statistics

DOI: 10.1007/S00453-005-1176-8

access: closed

type: Journal Article

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BroersmaFKW06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BroersmaFKW06
Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger:
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica 44(4): 343-361 (2006)

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.