Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3007920226 / 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: Every planar graph is the intersection graph of segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of L-shapes and segments in the plane / 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: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and coloring problems for relatives of intervals / 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: Triangle-free intersection graphs of line segments with large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Coloring Problem. / 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: On bounding the chromatic number of L-graphs / 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: Coloring intersection graphs of arc-connected sets in the plane / 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: Outerstring Graphs are $\chi$-Bounded / 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 curves that cross a fixed curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of χ‐boundedness / 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 triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors / 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: Colouring arcwise connected sets in the plane. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:47, 23 August 2024

scientific article; zbMATH DE number 7793128
Language Label Description Also known as
English
Coloring triangle-free L-graphs with \(O (\log \log n)\) colors
scientific article; zbMATH DE number 7793128

    Statements

    Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (English)
    0 references
    0 references
    23 January 2024
    0 references
    triangle-free intersection graphs
    0 references
    chromatic number
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers