IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v273y2016icp68-73.html
   My bibliography  Save this article

Acyclic and star coloring of P4-reducible and P4-sparse graphs

Author

Listed:
  • Yue, Jun

Abstract

An acyclic coloring of a graph G is a proper vertex coloring such that G contains no bicolored cycles. The more restricted notion of star coloring of G is an acyclic coloring in which each path of length 3 is not bicolored. In this paper, we mainly study on the acyclic and star coloring of P4-reducible and P4-sparse graphs. Moreover, we list polynomial-time algorithms for giving an optimal acyclic or star coloring of a P4-reducible or P4-sparse graph.

Suggested Citation

  • Yue, Jun, 2016. "Acyclic and star coloring of P4-reducible and P4-sparse graphs," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 68-73.
    • Handle: RePEc:eee:apmaco:v:273:y:2016:i:c:p:68-73
    DOI: 10.1016/j.amc.2015.09.084
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315013223
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.09.084?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. Yue, Jun & Wei, Meiqin & Li, Min & Liu, Guodong, 2018. "On the double Roman domination of graphs," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 669-675.

    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:eee:apmaco:v:273:y:2016:i:c:p:68-73. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.