# Pathwidth

## Papers overview

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

2018

2018

- APPROX-RANDOM
- 2018

We consider the problem of sampling a proper k-coloring of a graph of maximal degree âˆ† uniformly at random. We describe a newâ€¦Â (More)

Is this relevant?

2012

2012

- SIAM J. Discrete Math.
- 2012

It is proven that the connected pathwidth of any graph G is at most 2 Â· pw(G) + 1, where pw(G) is the pathwidth of G. The methodâ€¦Â (More)

Is this relevant?

2011

2011

- Electronic Notes in Discrete Mathematics
- 2011

For each non-negative integer k, we provide all outerplanar obstructions for the class of graphs whose cycle matroid hasâ€¦Â (More)

Is this relevant?

2008

2008

- SIAM J. Discrete Math.
- 2008

We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear codeâ€¦Â (More)

Is this relevant?

2007

2007

- WG
- 2007

The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidthâ€¦Â (More)

Is this relevant?

2006

2006

- Inf. Process. Lett.
- 2006

We prove that for any Îµ > 0 there exists an integer nÎµ such that the pathwidth of every cubic graph on n > nÎµ vertices is at mostâ€¦Â (More)

Is this relevant?

2005

2005

- MFCS
- 2005

We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be usedâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- J. Algorithms
- 1996

In this paper we give, for all constants k, l, explicit algorithms, that given a graph G = (V, E) with a tree-decomposition of Gâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- SIAM J. Comput.
- 1996

In this paper, we give for constant k a linear-time algorithm that, given a graph G (V, E), determines whether the treewidth of Gâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- J. Algorithms
- 1995

Various parameters of graphs connected to sparse matrix factoriza-tion and other applications can be approximated using anâ€¦Â (More)

Is this relevant?