IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/82d3dc18-0258-4f07-9b7f-de220c8d4e3f.html
   My bibliography  Save this paper

On the generalized ϑ-number and related problems for highly symmetric graphs

Author

Listed:
  • Sinjorgo, Lennart

    (Tilburg University, School of Economics and Management)

  • Sotirov, Renata

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • Sinjorgo, Lennart & Sotirov, Renata, 2022. "On the generalized ϑ-number and related problems for highly symmetric graphs," Other publications TiSEM 82d3dc18-0258-4f07-9b7f-d, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:82d3dc18-0258-4f07-9b7f-de220c8d4e3f
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/65733918/On_the_generalized_number_and_related_problems_for_highly_symmetric_graphs.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. de Klerk, E. & Pasechnik, D.V., 2007. "A note on the stability number of an orthogonality graph," Other publications TiSEM fb61fc0a-a843-4a66-8a69-3, Tilburg University, School of Economics and Management.
    2. Kuryatnikova, Olga & Sotirov, Renata & Vera, J.C., 2022. "The maximum $k$-colorable subgraph problem and related problems," Other publications TiSEM 40e477c0-a78e-4ee1-92de-8, Tilburg University, School of Economics and Management.
    3. Malaguti, Enrico & Toth, Paolo, 2008. "An evolutionary approach for bandwidth multicoloring problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 638-651, September.
    4. Pierre Fouilhoux & A. Mahjoub, 2012. "Solving VLSI design and DNA sequencing problems using bipartization of graphs," Computational Optimization and Applications, Springer, vol. 51(2), pages 749-781, March.
    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. Olga Kuryatnikova & Renata Sotirov & Juan C. Vera, 2022. "The Maximum k -Colorable Subgraph Problem and Related Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 656-669, January.
    2. Kuryatnikova, Olga & Sotirov, Renata & Vera, J.C., 2022. "The maximum $k$-colorable subgraph problem and related problems," Other publications TiSEM 40e477c0-a78e-4ee1-92de-8, Tilburg University, School of Economics and Management.

    More about this item

    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:tiu:tiutis:82d3dc18-0258-4f07-9b7f-de220c8d4e3f. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.