All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

The χ-Binding Function of d-Directional Segment Graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F25%3A00144086" target="_blank" >RIV/00216224:14330/25:00144086 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/s00454-025-00737-2" target="_blank" >https://doi.org/10.1007/s00454-025-00737-2</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s00454-025-00737-2" target="_blank" >10.1007/s00454-025-00737-2</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    The χ-Binding Function of d-Directional Segment Graphs

  • Original language description

    Given a positive integer d, the class d-DIR is defined as all those intersection graphs formed from a finite collection of line segments in R-2 having at most d slopes. Since each slope induces an interval graph, it easily follows for every G in d-DIR with clique number at most omega that the chromatic number chi(G) of G is at most d omega. We show for every even value of omega how to construct a graph in d-DIR that meets this bound exactly. This partially confirms a conjecture of Bhattacharya, Dvorak and Noorizadeh. Furthermore, we show that the chi-binding function of d-DIR is omega bar right arrow d omega for omega even and omega bar right arrow d(omega-1)+1 for omega odd. This extends an earlier result by Kostochka and Nesetril, which treated the special case d=2.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2025

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    DISCRETE & COMPUTATIONAL GEOMETRY

  • ISSN

    0179-5376

  • e-ISSN

    1432-0444

  • Volume of the periodical

    74

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    13

  • Pages from-to

    758-770

  • UT code for WoS article

    001489543200001

  • EID of the result in the Scopus database

    2-s2.0-105005115811