Publications associées à Coloring some classes of mixed graphs

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

Coloring some classes of mixed graphs

Graph Chatbot

Chattez avec Graph Search

Lower bounds on the obstacle number of graphs

Approximating Graphic TSP by Matchings

Graphs that Admit Right Angle Crossing Drawings

Split-critical and uniquely split-colorable graphs

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

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

Coloring axis-parallel rectangles

Degree-constrained edge partitioning in graphs arising from discrete tomography

Blockers and transversals

Graph coloring with cardinality constraints on the neighborhoods

Approximating Graphic TSP by Matchings

Split-critical and uniquely split-colorable graphs

Graphs that Admit Right Angle Crossing Drawings

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

Lower bounds on the obstacle number of graphs

Blockers and transversals

Graph coloring with cardinality constraints on the neighborhoods

Coloring axis-parallel rectangles

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

Degree-constrained edge partitioning in graphs arising from discrete tomography