"The graph tessellation cover number: Chromatic bounds, efficient ..."

Alexandre Santiago de Abreu et al. (2020)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2019.09.013

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/AbreuCFKMPP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AbreuCFKMPP20
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness. Theor. Comput. Sci. 801: 175-191 (2020)

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.