Minimum gradation in greyscales of graphs

DOI10.1016/j.disopt.2023.100773zbMath1517.05053arXiv1612.07552MaRDI QIDQ6108924

María A. Garrido-Vizuete, María Trinidad Villar-Liñán, Rafael Robles, Natalia de Castro

Publication date: 30 June 2023

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.07552

zbMATH Keywords

graph colouringgraph algorithmsgreyscaleminimum gradation

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Contrast in greyscales of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on spectrum graph coloring
• Graph labellings with variable weights, a survey
• Contrast in greyscales of graphs
• Minimum sum coloring problem: upper bounds for the chromatic strength
• On some applications of the selective graph coloring problem
• On Maximum Differential Graph Coloring
• On Some Variants of the Bandwidth Minimization Problem
• Choosing Colors for Geometric Graphs Via Color Space Embeddings
• Community structure in social and biological networks
• A Theorem on Boolean Matrices

This page was built for publication: Minimum gradation in greyscales of graphs