# Forbidden graph characterization

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- ESA
- 2014

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

- Eur. J. Comb.
- 2012

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)

Is this relevant?

2012

2012

- ArXiv
- 2012

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)

Is this relevant?

2012

2012

- Australasian J. Combinatorics
- 2012

A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned toâ€¦Â (More)

Is this relevant?

2010

2010

- Discrete Applied Mathematics
- 2010

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)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Inf. Process. Lett.
- 1996

This paper is concerned with the fixed-parameter tractability of the problem of deciding whether a graph can be made into a graphâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Discrete Mathematics
- 1996

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

- Discrete Mathematics
- 1994

The classification of sets of permutations with forbidden subsequences of length 4 is not yet complete. (In my recent paperâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Discrete Mathematics
- 1990

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

- J. ACM
- 1982

A series-parallel graph can be constructed from a certain graph by recurslvely applying "series" and "parallel" connections Theâ€¦Â (More)

Is this relevant?