Buscar
Mostrando ítems 1-10 de 46
Forbidden vertices
(2015)
Forbidden Vertices
(2015)
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
(Elsevier Science, 2015-12)
We study the computational complexity of the minimum dominating set problem on graphs restricted by forbidden induced subgraphs. We give some dichotomies results for the problem on graphs defined by any combination of ...
Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property
(John Wiley & Sons Inc, 2020-02-20)
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighborhood of each vertex is an interval in the enumeration. In this study, we give a minimal forbidden induced subgraph characterization ...
A pair of forbidden subgraphs and perfect matchings
(Academic Press Inc Elsevier ScienceSan DiegoEUA, 2006)
Forbidden subgraphs and the König–Egerváry property
(Elsevier Science, 2013-11)
The matching number of a graph is the maximum size of a set of vertex-disjoint edges. The transversal number is the minimum number of vertices needed to meet every edge. A graph has the König-Egerváry property if its ...
Forbidden subgraphs and the König–Egerváry property
(Elsevier, 2013)
The matching number of a graph is the maximum size of a set of vertex-disjoint edges.
The transversal number is the minimum number of vertices needed to meet every edge.
A graph has the König–Egerváry property if its ...
Probe interval graphs and probe unit interval graphs on superclasses of cographs
(Discrete Mathematics Theoretical Computer Science, 2013-08)
A graph is probe (unit) interval if its vertices can be partitioned into two sets: a set of probe vertices and a set of nonprobe vertices, so that the set of nonprobe vertices is a stable set and it is possible to obtain ...