Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00454-023-00592-z / rank
Normal rank
 
Property / cites work
 
Property / cites work: On a Coloring Problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refining the hierarchies of classes of geometric intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turán-type theorem on chords of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Graphs of Rays and Grounded Segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max point-tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring and Maximum Independent Set of Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for colouring circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graphs are quadratically χ‐bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a New Separator Theorem for String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets and cliques in intersection graphs of filaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of multiple interval graphs and overlap graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On grounded \(\llcorner\)-graphs and their relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and coloring polygon-circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line approach to off-line coloring problems on graphs with geometric representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring intersection graphs of arc-connected sets in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounding the chromatic number of L-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring arcwise connected sets in the plane. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max clique problem in classes of string-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free geometric intersection graphs with large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outerstring Graphs are $\chi$-Bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of χ‐boundedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring intersection graphs of \(x\)-monotone curves in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring triangle-free L-graphs with \(O (\log \log n)\) colors / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00454-023-00592-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:50, 30 December 2024

scientific article; zbMATH DE number 7781570
Language Label Description Also known as
English
Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
scientific article; zbMATH DE number 7781570

    Statements

    Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 December 2023
    0 references
    \( \chi \)-boundedness
    0 references
    geometric intersection graphs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers