IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v217y2014i1p385-39710.1007-s10479-014-1537-2.html
   My bibliography  Save this article

Restricted coloring problems on Graphs with few P 4 ’s

Author

Listed:
  • Cláudia Linhares-Sales
  • Ana Maia
  • Nicolas Martins
  • Rudini Sampaio

Abstract

In this paper, we obtain linear time algorithms to determine the acyclic chromatic number, the star chromatic number, the non repetitive chromatic number and the clique chromatic number of P 4 -tidy graphs and (q, q − 4)-graphs, for every fixed q, which are the graphs such that every set with at most q vertices induces at most q − 4 distinct P 4 ’s. These classes include cographs and P 4 -sparse graphs. We also obtain a linear time algorithm to compute the harmonious chromatic number of connected P 4 -tidy graphs and connected (q, q − 4)-graphs. All these coloring problems are known to be NP-hard for general graphs. These algorithms are fixed parameter tractable on the parameter q(G), which is the minimum q such that G is a (q, q − 4)-graph. We also prove that every connected (q, q − 4)-graph with at least q vertices is 2-clique-colorable and that every acyclic coloring of a cograph is also nonrepetitive, generalizing the main result of Lyons ( 2011 ). Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Cláudia Linhares-Sales & Ana Maia & Nicolas Martins & Rudini Sampaio, 2014. "Restricted coloring problems on Graphs with few P 4 ’s," Annals of Operations Research, Springer, vol. 217(1), pages 385-397, June.
    • Handle: RePEc:spr:annopr:v:217:y:2014:i:1:p:385-397:10.1007/s10479-014-1537-2
    DOI: 10.1007/s10479-014-1537-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-014-1537-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-014-1537-2?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.

    References listed on IDEAS

    as
    1. Flavia Bonomo & Guillermo Durán & Javier Marenco, 2009. "Exploring the complexity boundary between coloring and list-coloring," Annals of Operations Research, Springer, vol. 169(1), pages 3-16, July.
    2. Jaroslaw Grytczuk, 2007. "Nonrepetitive Colorings of Graphs—A Survey," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2007, pages 1-10, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Trotta, Manuel & Archetti, Claudia & Feillet, Dominique & Quilliot, Alain, 2022. "Pickup and delivery problems with autonomous vehicles on rings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 221-236.
    2. Markus Bohlin & Sara Gestrelius & Florian Dahms & Matúš Mihalák & Holger Flier, 2016. "Optimization Methods for Multistage Freight Train Formation," Transportation Science, INFORMS, vol. 50(3), pages 823-840, August.
    3. Leonardo Lamorgese & Carlo Mannino, 2015. "An Exact Decomposition Approach for the Real-Time Train Dispatching Problem," Operations Research, INFORMS, vol. 63(1), pages 48-64, February.

    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:annopr:v:217:y:2014:i:1:p:385-397:10.1007/s10479-014-1537-2. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.