The rank-width of the square grid

Discrete Applied Mathematics

Volumn 158, Issue 7, 2010, Pages 841-850

  Jelínek, Vít ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Graph decomposition; Grid graph; Rank width

Indexed keywords

CLIQUE-WIDTH; GRAPH DECOMPOSITIONS; GRID GRAPHS; OPEN PROBLEMS; RANK-WIDTH; SQUARE GRID; VERTEX SET;

GRAPH THEORY;

EID: 77649271507     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.02.007     Document Type: Article

References (6)

1. Oum S., and Seymour P. Approximating clique-width and branch-width. J. Combin. Theory, Ser. B 96 4 (2006) 514-528
2. Oum S. Rank-width is less than or equal to branch-width. J. Graph Theory 57 3 (2007) 239-244
3. Hliněný P., and Oum S. Finding branch-decompositions and rank-decompositions. SIAM J. Comput. 38 3 (2008) 1012-1032
4. Hliněný P., Oum S., Seese D., and Gottlob G. Width parameters beyond tree-width and their applications. Comput. J. 51 3 (2008) 326-362
5. S. Oum, Recognizing rank-width, in: Oberwolfach Workshop "Graph Theory" (2005); http://math.kaist.ac.kr/~sangil/pdf/oberwolfach2005.pdf
6. S. Oum, Introduction to rank-width, in: Third Workshop on Graph Classes, Optimization, and Width Parameters, Eugene, 2007; http://math.kaist.ac.kr/~sangil/pdf/2007eugene.pdf