Maximum Differential Coloring of Caterpillars and Spiders

No abstract is available for this paper.

• Publication year

  2013

• Venue

  arXiv.org

• Publication date

  2013-02-28

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Antibandwidth of Bipartite Graphs

  2012cited by this paper
• GRASP with path relinking heuristics for the antibandwidth problem

  2011cited by this paper
• Memetic algorithm for the antibandwidth maximization problem

  2011cited by this paper
• GMap: Visualizing graphs and clusters as maps

  2010cited by this paper
• On Maximum Differential Graph Coloring

  2010cited by this paper
• Antibandwidth of d-Dimensional Meshes

  2009cited by this paper
• Antibandwidth and cyclic antibandwidth of Hamming graphs

  2009cited by this paper
• Bandwidth on AT-Free Graphs

  2009cited by this paper
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes

  2009cited by this paper
• On explicit formulas for bandwidth and antibandwidth of hypercubes

  2009cited by this paper
• Bandwidth of bipartite permutation graphs in polynomial time

  2008cited by this paper
• Antibandwidth of Three-Dimensional Meshes

  2007cited by this paper
• Antibandwidth of Complete k-Ary Trees

  2006cited by this paper
• Characterization of unlabeled level planar trees

  2006cited by this paper
• Graph colorings

  2005cited by this paper
• Equitable Coloring of k-Uniform Hypergraphs

  2002cited by this paper
• I and i

  2001cited by this paper
• Powers of Hamiltonian paths in interval graphs

  1998cited by this paper
• Bandwidth of Chain Graphs

  1998cited by this paper
• On the separation number of a graph

  1989influential reference
• The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete

  1986cited by this paper
• On Some Variants of the Bandwidth Minimization Problem

  1984cited by this paper
• The Bandwidth of Caterpillars with Hairs of Length 1 and 2

  1981cited by this paper
• Frequency assignment: Theory and applications

  1980cited by this paper
• The NP-Completeness of the bandwidth minimization problem

  1976cited by this paper
• Proof of a conjecture of P. Erdös on the derivative of a polynomial

  1944cited by this paper

• A note on computational approaches for the antibandwidth problem

  2019cites this paper