A note on maximum differential coloring of planar graphs
From MaRDI portal
Publication:473207
DOI10.1016/j.jda.2014.06.004zbMath1309.05066OpenAlexW2018399909MaRDI QIDQ473207
Michael Kaufmann, Stephen G. Kobourov, Michael A. Bekos, Sankar Veeramoni
Publication date: 24 November 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2014.06.004
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
The maximum \(k\)-differential coloring problem ⋮ A note on computational approaches for the antibandwidth problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bandwidth of chain graphs
- Memetic algorithm for the antibandwidth maximization problem
- Antibandwidth of three-dimensional meshes
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- The NP-completeness of the bandwidth minimization problem
- Recent advances in algorithms and combinatorics
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- On Maximum Differential Graph Coloring
- GRASP with path relinking heuristics for the antibandwidth problem
- On Some Variants of the Bandwidth Minimization Problem
- Antibandwidth of Complete k-Ary Trees
- Bandwidth on AT-Free Graphs
- On the separation number of a graph
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2
- Powers of Hamiltonian paths in interval graphs
- Graph Colorings
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
This page was built for publication: A note on maximum differential coloring of planar graphs
