The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem

Título:

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem

Autor:

Simone Dantas de Souza

Ano:

2015

DOI:

10.1016/j.dam.2013.09.004

Revista:

DISCRETE APPLIED MATHEMATICS

ISSN:

0166218X

Tags:

graph sandwich problem

forbidden subgraph

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

DCJ-indel and DCJ-substitution distances with distinct operation costs

The hunting of a snark with total chromatic number 5

Dominating sets inducing large components

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

Neighbour-distinguishing labellings of powers of paths and powers of cycles

The Graph Sandwich Problem for P4-sparse graphs

Solitaire Clobber on Circulant Graphs

Averaging 2-rainbow domination and Roman domination

Relating 2-rainbow domination to Roman domination

The Polynomial Dichotomy for Three Nonempty Part Sandwich Problems