We analyse classes of planar graphs with respect to various properties such as polynomial-time solvability of the DOMINATING SET problem or boundedness of the tree-width. A helpful tool to address this question is the notion of boundary classes. The main result of the paper is that for many important properties there are exactly two boundary classes of planar graphs
AbstractA graph G is a domination graph if each induced subgraph of G has a pair of vertices such th...
LNCS n°9843An upper dominating set in a graph is a minimal (with respect to set inclusion) dominatin...
AbstractAny graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable when...
Any graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable when restric...
AbstractThe notion of a boundary class has been recently introduced as a tool for classification of ...
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that nee...
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of ma...
The notion of a boundary graph property was recently introduced as a relaxation of that of a minimal...
AbstractThe notion of a boundary graph property was recently introduced as a relaxation of that of a...
Collected in this volume are most of the important theorems and algorithms currently known for plana...
AbstractMany problems that are intractable for general graphs allow polynomial-time solutions for st...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
Many problems that are intractable for general graphs allow polynomial-time solutions for structured...
AbstractWe consider a subclass of planar graphs, slightly wider than the class of outerplanar graphs...
AbstractThe coefficient of fragmentability of a class of graphs measures the proportion of vertices ...
AbstractA graph G is a domination graph if each induced subgraph of G has a pair of vertices such th...
LNCS n°9843An upper dominating set in a graph is a minimal (with respect to set inclusion) dominatin...
AbstractAny graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable when...
Any graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable when restric...
AbstractThe notion of a boundary class has been recently introduced as a tool for classification of ...
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that nee...
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of ma...
The notion of a boundary graph property was recently introduced as a relaxation of that of a minimal...
AbstractThe notion of a boundary graph property was recently introduced as a relaxation of that of a...
Collected in this volume are most of the important theorems and algorithms currently known for plana...
AbstractMany problems that are intractable for general graphs allow polynomial-time solutions for st...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
Many problems that are intractable for general graphs allow polynomial-time solutions for structured...
AbstractWe consider a subclass of planar graphs, slightly wider than the class of outerplanar graphs...
AbstractThe coefficient of fragmentability of a class of graphs measures the proportion of vertices ...
AbstractA graph G is a domination graph if each induced subgraph of G has a pair of vertices such th...
LNCS n°9843An upper dominating set in a graph is a minimal (with respect to set inclusion) dominatin...
AbstractAny graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable when...
DOI
Add to ORKG