Total tessellation cover: bounds, hardness, and applications
type: Item
instance of: scholarly article
title: Total tessellation cover: bounds, hardness, and applications
zbMATH Open document ID: 1502.05197
author: Alexandre Abreu
author: Luís Felipe Ignácio Cunha
author: Franklin Marquezino
author: R. Portugal
author: C. M. H. Figueiredo
author: Daniel F. D. Posner
published in: Discrete Applied Mathematics
publication date: 2022-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7610738
zbMATH Keywords: graph tessellation
zbMATH Keywords: graph coloring
zbMATH Keywords: algorithms and complexity
zbMATH Keywords: quantum walks
describes a project that uses: CALMA
MaRDI profile type: Publication
full work available at URL: j.dam.2021.09.032
OpenAlex ID: W3208343810
cites work: Models and solution techniques for frequency assignment problems
cites work: The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
cites work: A computational complexity comparative study of graph tessellation problems
cites work: Implementation of quantum walks on IBM quantum computers
cites work: Total colorings and list total colorings of planar graphs without intersecting 4-cycles
cites work: New linear-time algorithms for edge-coloring planar graphs
cites work: Q4198056
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
cites work: Chromatic index of graphs with no cycle with a unique chord
cites work: Total colouring regular bipartite graphs is NP-hard
cites work: Quantum walks and search algorithms
cites work: The staggered quantum walk model
DOI: 10.1016/J.DAM.2021.09.032
description: scientific article; zbMATH DE number 7610738