Add to ORKGBy applying a topological approach due to Kahn, Saks and Sturtevant, we prove all decreasing graph properties consisting of bipartite graphs only are elusive. This is an analogue to a well-known result of Yao. (orig.)Also published as: SFB-303--94832Available from TIB Hannover: RN 4052(94832) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
The recognition of threshold graphs, those graphs with threshold dimension one, is well understood a...
For a fixed graph property Q, the complexity of the problem: Given a graph G, does G have property Q...
A bipartite graph G = (L,R;E) is said to be identifiable if for every vertex v ∈ L, the subgraph in...
In this paper we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn gr...
AbstractTurán (1984) [11] initiated the study of the sensitivity complexity of graph properties. He ...
AbstractDNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet....
A graph with n vertices is well-covered if every maximal independent set is a maximum independent se...
DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this...
AbstractIn this paper, we study directed graph versions of tolerance graphs, in particular, the clas...
Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point ...
AbstractLet P be a property of graphs on a fixed n-element vertex set V. The complexity c(P) is the ...
summary:In response to [3] and [4] we prove that the recognition of cover graphs of finite posets is...
Graphs are a basic tool in modern data representation. The richness of the topological information c...
Cai and Schieber (1997) proved that bipartite graphs plus one edge can be recognized in linear time....
AbstractCai and Schieber (1997) proved that bipartite graphs plus one edge can be recognized in line...
The recognition of threshold graphs, those graphs with threshold dimension one, is well understood a...
For a fixed graph property Q, the complexity of the problem: Given a graph G, does G have property Q...
A bipartite graph G = (L,R;E) is said to be identifiable if for every vertex v ∈ L, the subgraph in...
In this paper we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn gr...
AbstractTurán (1984) [11] initiated the study of the sensitivity complexity of graph properties. He ...
AbstractDNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet....
A graph with n vertices is well-covered if every maximal independent set is a maximum independent se...
DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this...
AbstractIn this paper, we study directed graph versions of tolerance graphs, in particular, the clas...
Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point ...
AbstractLet P be a property of graphs on a fixed n-element vertex set V. The complexity c(P) is the ...
summary:In response to [3] and [4] we prove that the recognition of cover graphs of finite posets is...
Graphs are a basic tool in modern data representation. The richness of the topological information c...
Cai and Schieber (1997) proved that bipartite graphs plus one edge can be recognized in linear time....
AbstractCai and Schieber (1997) proved that bipartite graphs plus one edge can be recognized in line...
The recognition of threshold graphs, those graphs with threshold dimension one, is well understood a...
For a fixed graph property Q, the complexity of the problem: Given a graph G, does G have property Q...
A bipartite graph G = (L,R;E) is said to be identifiable if for every vertex v ∈ L, the subgraph in...