Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors

Discrete and Computational Geometry - United States
doi 10.1007/s00454-012-9425-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs

SIAM Journal on Discrete Mathematics
Mathematics
2018English

Coloring a Graph Optimally With Two Colors

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1993English

Coloring Square-Free Berge Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion

2006English

Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ Is Large

SIAM Journal on Discrete Mathematics
Mathematics
2019English

Development of a Color Calendar for Food Colors Using Natural Colors

English

Total Coloring of Claw-Free Planar Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Coloring Signed Graphs Using DFS

Optimization Letters
ControlOptimization
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy