scientific article; zbMATH DE number 5279371

zbMath1153.05026MaRDI QIDQ5387673

Mustapha Kchikech, Olivier Togni

Publication date: 27 May 2008

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/82/showToc.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

weighted graphmulticolouringcolouring algorithmweighted chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable ⋮ Tight Lower Bounds for the Complexity of Multicoloring

This page was built for publication: