OpenAlex | Coloring triangle-free L-graphs with<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e89" altimg="si4.svg"><mml:mrow><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo class="qopname">log</mml:mo><mml:mo class="qopname">log</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math>colors

Coloring triangle-free L-graphs withO(loglogn)colors

Work

Year: 2023

Type: article

Abstract: It is proved that triangle-free intersection graphs of n L-shapes in the plane have chromatic number O(loglogn). This improves the previous bound of O(logn) (McGuinness, 1996) and matches the known lo... more

Source: European Journal of Combinatorics

Author Bartosz Walczak

Institution Jagiellonian University

Cites: 36

Cited by: 3

Related to: 10

FWCI: 1.913

Citation percentile (by year/subfield): 92.44

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Sustainable Development Goal Sustainable cities and communities

Open Access status: hybrid

APC paid (est): $2,880

Funders Narodowe Centrum Nauki, Narodowym Centrum Nauki

Grant IDS 2015/17/D/ST1/00585,