A class of graphs with large rankwidth

We describe several graphs with arbitrarily large rankwidth (or equivalently with arbitrarily large cliquewidth). Korpelainen, Lozin, and Mayhill [Split permutation graphs, Graphs and Combinatorics, 30(3):633–646, 2014] proved that there exist split graphs with Dilworth number 2 with arbitrarily lar...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics Vol. 347; no. 1; p. 113699
Main Authors:	Hoàng, Chính T., Trotignon, Nicolas
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.01.2024 Elsevier
Subjects:	Cliquewidth Computer Science Dilworth number Even-hole-free graphs Mathematics Rankwidth Rings Cliquewidth Rankwidth Even-hole-free graphs Dilworth number Rings
ISSN:	0012-365X, 1872-681X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!