Forbidden graph characterization

Known as: Forbidden minor, Forbidden minor characterization, Forbidden induced subgraph 
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphsthat do not belong… (More)
Wikipedia

Related topics

Related topics

49 relations
1-planar graphAlgorithmApex graphApollonian network
(More)

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Ordering without forbidden patterns
Let F be a set of ordered patterns, i.e., graphs whose vertices are linearly ordered. An F-free ordering of the vertices of a… (More)
Is this relevant?
2012
2012
Forbidden graphs for tree-depth
For every k ≥ 0, we define Gk as the class of graphs with treedepth at most k, i.e. the class containing every graph G admitting… (More)
  • figure 1
Is this relevant?
2012
2012
Planar F-Deletion: Approximation and Optimal FPT Algorithms
Let F be a finite set of graphs. In the F-Deletion problem, we are given an n-vertex, m-edge graph G and an integer k as input… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
Forbidden subgraph characterization of bipartite unit probe interval graphs
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
A forbidden subgraph characterization of line-polar bipartite graphs
A graph is polar if the vertex set can be partitioned into A and B in such a way that the subgraph induced by A is a complete… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties
This paper is concerned with the fixed-parameter tractability of the problem of deciding whether a graph can be made into a graph… (More)
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Generating trees and forbidden subsequences
We discuss an enumerative technique called generating frees which was introduced in the study of Baxter permutations. We apply… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Forbidden subsequences
The classification of sets of permutations with forbidden subsequences of length 4 is not yet complete. (In my recent paper… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Forbidden minors characterization of partial 3-trees
A k-tree is formed from a k-complete graph by recursively adding a vertex adjacent to all vertices in an existing k-complete… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Linear-time computability of combinatorial problems on series-parallel graphs
A series-parallel graph can be constructed from a certain graph by recurslvely applying "series" and "parallel" connections The… (More)
  • figure I
  • figure 2
  • figure 7
Is this relevant?