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

On acyclically 4-colorable maximal planar graphs

Author

Listed:
  • Zhu, Enqiang
  • Li, Zepeng
  • Shao, Zehui
  • Xu, Jin

Abstract

An acyclic coloring of a graph is a proper coloring of the graph, for which every cycle uses at least three colors. Let G4 be the set of maximal planar graphs of minimum degree 4, such that each graph in G4 contains exactly four odd-vertices and the subgraph induced by the four odd-vertices contains a quadrilateral. In this article, we show that every acyclic 4-coloring of a maximal planar graph with exact four odd-vertices is locally equitable with regard to its four odd-vertices. Moreover, we obtain a necessary and sufficient condition for a graph in G4 to be acyclically 4-colorable, and give an enumeration of the acyclically 4-colorable graphs in G4.

Suggested Citation

  • Zhu, Enqiang & Li, Zepeng & Shao, Zehui & Xu, Jin, 2018. "On acyclically 4-colorable maximal planar graphs," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 402-407.
  • Handle: RePEc:eee:apmaco:v:329:y:2018:i:c:p:402-407
    DOI: 10.1016/j.amc.2018.02.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318301176
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2018.02.015?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. Assefaw H. Gebremedhin & Arijit Tarafdar & Alex Pothen & Andrea Walther, 2009. "Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 209-223, May.
    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. Cecilia Orellana Castro & Manolo Rodriguez Heredia & Aurelio R. L. Oliveira, 2023. "Recycling basic columns of the splitting preconditioner in interior point methods," Computational Optimization and Applications, Springer, vol. 86(1), pages 49-78, September.

    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:329:y:2018:i:c:p:402-407. 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: 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.