ScholarLens Back to search
2019•Journal of Combinatorial Theory Series BRequires access

Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor

Ken‐ichi Kawarabayashi, Yusuke Kobayashi

Open publisher page 11 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Treewidth, Graph minor, Combinatorics, Robertson–Seymour theorem, Mathematics, Minor (academic), Tree decomposition, Partial k-tree

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor — Research Paper | ScholarLens