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

A note on decomposing graphs to locally almost irregular subgraphs

Author

Listed:
  • Przybyło, Jakub

Abstract

We consider a concept related with decompositions of graphs to locally irregular subgraphs and the notion of almost irregular subgraphs, introduced recently by Alon and Wei. We say that a graph is locally almost irregular if its every vertex has at most one neighbour with the same degree as itself. We conjecture that any graph can be edge decomposed to two locally almost irregular subgraphs, and we prove a relaxation of this supposition, where we admit for every vertex v more than one, yet finitely bounded number of neighbours with the same degree as v. In particular we show it suffices to allow 7 such neighbours in the case of regular graph, and no more than 48 in general.

Suggested Citation

  • Przybyło, Jakub, 2024. "A note on decomposing graphs to locally almost irregular subgraphs," Applied Mathematics and Computation, Elsevier, vol. 470(C).
  • Handle: RePEc:eee:apmaco:v:470:y:2024:i:c:s0096300324000560
    DOI: 10.1016/j.amc.2024.128584
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2024.128584?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. Jelena Sedlar & Riste Škrekovski, 2021. "Remarks on the Local Irregularity Conjecture," Mathematics, MDPI, vol. 9(24), pages 1-10, December.
    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. Grzelec, Igor & Woźniak, Mariusz, 2023. "On decomposing multigraphs into locally irregular submultigraphs," Applied Mathematics and Computation, Elsevier, vol. 452(C).
    2. Hui Lei & Xiaopan Lian & Yongtang Shi & Ran Zhao, 2022. "Graph Classes with Locally Irregular Chromatic Index at most 4," Journal of Optimization Theory and Applications, Springer, vol. 195(3), pages 903-918, December.

    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:470:y:2024:i:c:s0096300324000560. 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.