Tree-width and dimension-Reference-Cited by-同舟云学术

Tree-width and dimension

Published:2015-02-25 Issue:4 Volume:36 Page:431-450
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Joret Gwenaël,Micek Piotr,Milans Kevin G.,Trotter William T.,Walczak Bartosz,Wang Ruidong

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-014-3081-8.pdf

Reference34 articles.

1. B. S. Baker: Approximation algorithms for NP-complete problems on planar graphs, in: Proc. 24th Annual Symposium on Foundations of Computer Science, 1983, 265–273; also in a journal version in: J. Assoc. Comput. Machin. 41 (1994), 153–180.

2. K. Baker, P. C. Fishburn and F. Roberts: Partial orders of dimension 2, interval orders and interval graphs, Networks 2 (1971), 11–28.

3. G. Di Battista, W.-P. Liu and I. Rival: Bipartite graphs, upward drawings, and planarity, Inform. Process. Lett. 36 (1990), 317–322.

4. C. Biró, M. T. Keller and S. J. Young: Posets with cover graphs of pathwidth two have bounded dimension, Order, in press and available on the ArXiv at 1308.4877v3.

5. H. L. Bodlaender: Planar graphs with bounded treewidth, Technical Report RUUCS-88-14, University of Utrecht, 1988.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Concepts of Dimension for Convex Geometries;SIAM Journal on Discrete Mathematics;2024-05-22

2. Dimension is polynomial in height for posets with planar cover graphs;Journal of Combinatorial Theory, Series B;2024-03

3. Excluding a Ladder;Combinatorica;2021-11-25

4. Local Dimension is Unbounded for Planar Posets;The Electronic Journal of Combinatorics;2020-11-13

5. Planar Posets that are Accessible from Below Have Dimension at Most 6;Order;2020-06-02