Partitioning a graph into convex sets

Título:

Partitioning a graph into convex sets

Autor:

Simone Dantas de Souza

Ano:

2011

DOI:

10.1016/j.disc.2011.05.023

Revista:

DISCRETE MATHEMATICS

ISSN:

0012365X

Tags:

Convex partitions

Idioma:

Português

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Genomic distance with high indel costs

Extended Skew Partition Problem

Colouring clique-hypergraphs of circulant graphs

Solitaire Clobber on Circulant Graphs

Dominating sets inducing large components

The ( k , - ) partitioned probe problem: NP-complete versus polynomial dichotomy

The Graph Sandwich Problem for P4-sparse graphs

Domination and total domination in cubic graphs of large girth

Averaging 2-rainbow domination and Roman domination

Relating 2-rainbow domination to Roman domination