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

Coloring graphs without induced P5 or K5 − e

Author

Listed:
  • Xu, Yian

Abstract

We use P5 to denote a path of length 5 and C5 to denote a cycle of length 5. The aim of this paper is to prove that, if G is a connected graph satisfying (1). G has an induced C5 and no clique cut-set, (2). G has no induced subgraph isomorphic to P5 or K5−e, then G is max⁡{13,ω(G)+1}-colorable.

Suggested Citation

  • Xu, Yian, 2024. "Coloring graphs without induced P5 or K5 − e," Applied Mathematics and Computation, Elsevier, vol. 461(C).
    • Handle: RePEc:eee:apmaco:v:461:y:2024:i:c:s0096300323004836
    DOI: 10.1016/j.amc.2023.128314
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323004836
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128314?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. D. S. Malyshev, 2016. "Two cases of polynomial-time solvability for the coloring problem," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 833-845, February.
    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.

      More about this item

      Keywords

      P5; K5−e; Chromatic number; Clique number;
      All these keywords.

      JEL classification:

      • P5 - Political Economy and Comparative Economic Systems - - Comparative Economic Systems

      Statistics

      Access and download statistics

      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:461:y:2024:i:c:s0096300323004836. 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.