A note on maximum differential coloring of planar graphs

DOI10.1016/J.JDA.2014.06.004zbMATH Open1309.05066OpenAlexW2018399909MaRDI QIDQ473207FDOQ473207

Stephen G. Kobourov, Michael A. Bekos, Michael Kaufmann, 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

Recommendations

• On maximum differential graph coloring
• On the coloring of maximal planar graphs
• scientific article
• A note on the minimum total coloring of planar graphs
• Total colorings of planar graphs with large maximum degree
• The maximum \(k\)-differential coloring problem
• On the total coloring of planar graphs.
• Total coloring of recursive maximal planar graphs
• Differential coloring of graphs
• A note on vertex colorings of plane graphs

zbMATH Keywords

graph labelingcaterpillar graphantibandwidthseparation numberspider graph

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Colorings
• The NP-completeness of the bandwidth minimization problem
• Bandwidth of chain graphs
• The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
• The Bandwidth of Caterpillars with Hairs of Length 1 and 2
• GRASP with path relinking heuristics for the antibandwidth problem
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• On Some Variants of the Bandwidth Minimization Problem
• Antibandwidth of Complete k-Ary Trees
• On the separation number of a graph
• Title not available (Why is that?)
• Memetic algorithm for the antibandwidth maximization problem
• Title not available (Why is that?)
• On explicit formulas for bandwidth and antibandwidth of hypercubes
• Powers of Hamiltonian paths in interval graphs
• Recent advances in algorithms and combinatorics
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• On Maximum Differential Graph Coloring
• Bandwidth on AT-free graphs
• Title not available (Why is that?)
• Bandwidth of Bipartite Permutation Graphs in Polynomial Time
• Antibandwidth of three-dimensional meshes

Cited In (3)

• A note on the minimum total coloring of planar graphs
• The maximum \(k\)-differential coloring problem
• A note on computational approaches for the antibandwidth problem

This page was built for publication: A note on maximum differential coloring of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473207)