Chordal embeddings of planar graphs

@article{Bouchitt2003ChordalEO,
  title={Chordal embeddings of planar graphs},
  author={Vincent Bouchitt{\'e} and Fr{\'e}d{\'e}ric Mazoit and Ioan Todinca},
  journal={Discrete Mathematics},
  year={2003},
  volume={273},
  pages={85-102}
}
Robertson and Seymour conjectured that the treewidth of a planar graph and the treewidth of its geometric dual differ by at most one. Lapoire solved the conjecture in the affirmative, using algebraic techniques. We give here a much shorter proof of this result. 

From This Paper

Figures, tables, and topics from this paper.
21 Citations
20 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Todinca.Listing all potential maximal cliques of a graph,Theoret

  • I. V. Bouchitté
  • Comput. Sci.,
  • 2002
1 Excerpt

grouping the minimal separators,SIAM J

  • V. Bouchitté, I. Todinca, Treewidth, minimum fill-in
  • Comput. 31 (1)
  • 2001
1 Excerpt

Kratsch.Treewidth and pathwidth of permutation graphs,SIAM

  • H. L. Bodlaender, T. Kloks
  • J. Discrete Math
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…