Tree-width and large grid minors in planar graphs

Tree-width and large grid minors in planar graphs

Graphs and Algorithms

Bibliographic Details
Main Author:	Alexander Grigoriev
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2011-02-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/539/pdf

Similar Items

On the k-restricted structure ratio in planar and outerplanar graphs
by: Gruia Călinescu, et al.
Published: (2008-01-01)

Independent sets in graphs with an excluded clique minor
by: David R. Wood
Published: (2007-01-01)

List edge and list total colorings of planar graphs without non-induced 7-cycles
by: Aijun Dong, et al.
Published: (2013-03-01)

New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree
by: Xin Zhang, et al.
Published: (2011-09-01)

Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

A note on planar Ramsey numbers for a triangle versus wheels
by: Guofei Zhou, et al.
Published: (2012-11-01)

Acyclic chromatic index of fully subdivided graphs and Halin graphs
by: Manu Basavaraju
Published: (2012-10-01)

Arrangements Of Minors In The Positive Grassmannian And a Triangulation of The Hypersimplex
by: Miriam Farber, et al.
Published: (2015-01-01)

Probe split graphs
by: Van Bang Le, et al.
Published: (2007-01-01)

Generation of Cubic graphs
by: Gunnar Brinkmann, et al.
Published: (2011-07-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)

On the metric dimension of Grassmann graphs
by: Robert F. Bailey, et al.
Published: (2012-01-01)

On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01)

On hereditary Helly classes of graphs
by: Marina Groshaus, et al.
Published: (2008-01-01)

Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01)

The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01)

On Compact Encoding of Pagenumber $k$ Graphs
by: Cyril Gavoille, et al.
Published: (2008-01-01)

Extremal K_(s,t)-free bipartite graphs
by: Camino Balbuena, et al.
Published: (2008-01-01)

On the chromatic number of some flip graphs
by: Ruy Fabila-Monroy, et al.
Published: (2009-01-01)

On 4-valent Frobenius circulant graphs
by: Sanming Zhou
Published: (2012-10-01)

Graphs with many vertex-disjoint cycles
by: Dieter Rautenbach, et al.
Published: (2012-09-01)

Progress on the traceability conjecture for oriented graphs
by: Marietjie Frick, et al.
Published: (2008-01-01)

Complexity results on graphs with few cliques
by: Bill Rosgen, et al.
Published: (2007-01-01)

Upper k-tuple domination in graphs
by: Gerard Jennhwa Chang, et al.
Published: (2012-12-01)

All totally symmetric colored graphs
by: Mariusz Grech, et al.
Published: (2013-03-01)

Cycle transversals in bounded degree graphs
by: Marina Groshaus, et al.
Published: (2011-03-01)

The Erdős-Sós conjecture for geometric graphs
by: Luis Barba, et al.
Published: (2013-02-01)

Irregular edge coloring of 2-regular graphs
by: Sylwia Cichacz, et al.
Published: (2011-02-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

A variant of Niessen’s problem on degreesequences of graphs
by: Jiyun Guo, et al.
Published: (2014-05-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-01-01)

On the connectedness and diameter of a geometric Johnson graph
by: Crevel Bautista-Santiago, et al.
Published: (2013-09-01)

Immersion containment and connectivity in color-critical graphs
by: Faisal N. Abu-Khzam, et al.
Published: (2012-10-01)

Edge condition for long cycles in bipartite graphs
by: Lech Adamus
Published: (2009-01-01)

Independent sets in (P₆, diamond)-free graphs
by: Raffaele Mosca
Published: (2009-01-01)

On the number of maximal independent sets in a graph
by: David R. Wood
Published: (2011-09-01)

Total domination in K₅- and K₆-covered graphs
by: Odile Favaron, et al.
Published: (2008-01-01)

On the Book Thickness of k-Trees
by: Vida Dujmović, et al.
Published: (2011-10-01)