Publications associées à On some coloring problems in grids

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Shakhar Smorodinsky

Given a geometric hypergraph (or a range-space)

H=(V,\cal E)

, a coloring of its vertices is said to be conflict-free if for every hyperedge

S \in \cal E

there is at least one vertex in

S

whose color is distinct from the colors of all other vertices i ...

2010

On some coloring problems in grids

Graph Chatbot

Chattez avec Graph Search

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number

On coloring problems with local constraints

A note on chromatic properties of threshold graphs

Coloring fuzzy circular interval graphs

Universal Sets for Straight-Line Embeddings of Bicolored Graphs

Complexity of the critical node problem over trees

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid

An Optimal Linear-Time Algorithm for Interprocedural Register Allocation in High Level Synthesis Using SSA Form

Coloring axis-parallel rectangles

Complexity of the critical node problem over trees

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number

A note on chromatic properties of threshold graphs

Coloring fuzzy circular interval graphs

An Optimal Linear-Time Algorithm for Interprocedural Register Allocation in High Level Synthesis Using SSA Form

On coloring problems with local constraints

Universal Sets for Straight-Line Embeddings of Bicolored Graphs

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Coloring axis-parallel rectangles