Buscar
Mostrando ítems 1-10 de 71
Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
(Elsevier Science, 2015-01)
An undirected graph G is called a VPT graph if it is the vertex intersection graph of a family of paths in a tree. The class of graphs which admit a VPT representation in a host tree with maximum degree at most h is denoted ...
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 ...
A pair of forbidden subgraphs and perfect matchings
(Academic Press Inc Elsevier ScienceSan DiegoEUA, 2006)
Characterizing intersection graphs of substars of a star by forbidden subgraphs
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
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 ...
On minimal forbidden subgraph characterizations of balanced graphs
(2013)
A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd
chordless cycle as a submatrix. While a forbidden induced subgraph characterization of
balanced graphs is known, there is no ...
Essential obstacles to Helly circular-arc graphs
(Elsevier Science, 2022-10-30)
A Helly circular-arc graph is the intersection graph of a set of arcs on a circle having the Helly property. We introduce essential obstacles, which are a refinement of the notion of obstacles, and prove that essential ...