A note on maximum differential coloring of planar graphs

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

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

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)

Recommendations

• On maximum differential graph coloring
• On the coloring of maximal planar graphs
• scientific article; zbMATH DE number 5525887
• 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

Cites work

• scientific article; zbMATH DE number 1186230 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 568819 (Why is no real title available?)
• scientific article; zbMATH DE number 2016615 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Antibandwidth of Complete k-Ary Trees
• Antibandwidth of three-dimensional meshes
• Bandwidth of Bipartite Permutation Graphs in Polynomial Time
• Bandwidth of chain graphs
• Bandwidth on AT-free graphs
• GRASP with path relinking heuristics for the antibandwidth problem
• Graph Colorings
• Memetic algorithm for the antibandwidth maximization problem
• On Some Variants of the Bandwidth Minimization Problem
• On explicit formulas for bandwidth and antibandwidth of hypercubes
• On maximum differential graph coloring
• On the separation number of a graph
• Powers of Hamiltonian paths in interval graphs
• Recent advances in algorithms and combinatorics
• The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
• The Bandwidth of Caterpillars with Hairs of Length 1 and 2
• The NP-completeness of the bandwidth minimization problem

Cited in

(5)

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

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)