IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v30y2015i1d10.1007_s10878-013-9631-y.html
   My bibliography  Save this article

An algorithm for the dominator chromatic number of a tree

Author

Listed:
  • Houcine Boumediene Merouane

    (University of Blida)

  • Mustapha Chellali

    (University of Blida)

Abstract

A dominator coloring of a graph $$G$$ G is an assignment of colors to the vertices of $$G$$ G such that it is a proper coloring and every vertex dominates all the vertices of at least one color class. The minimum number of colors required for a dominator coloring of $$G$$ G is called the dominator chromatic number of $$G$$ G . In this paper, we give a polynomial time algorithm computing the dominator chromatic number for every nontrivial tree.

Suggested Citation

  • Houcine Boumediene Merouane & Mustapha Chellali, 2015. "An algorithm for the dominator chromatic number of a tree," Journal of Combinatorial Optimization, Springer, vol. 30(1), pages 27-33, July.
    • Handle: RePEc:spr:jcomop:v:30:y:2015:i:1:d:10.1007_s10878-013-9631-y
    DOI: 10.1007/s10878-013-9631-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9631-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-013-9631-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bachstein, Anna & Goddard, Wayne & Henning, Michael A. & Xue, John, 2022. "Compelling colorings: A generalization of the dominator chromatic number," Applied Mathematics and Computation, Elsevier, vol. 428(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:30:y:2015:i:1:d:10.1007_s10878-013-9631-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.