On rank-width of even-hole-free graphs
From MaRDI portal
Publication:4558968
zbMath1400.05232arXiv1611.09907MaRDI QIDQ4558968
Haiko Müller, Ngoc Khang Le, Kristina Vušković, Isolde Adler, Nicolas Trotignon, Marko Radovanović
Publication date: 30 November 2018
Full work available at URL: https://arxiv.org/abs/1611.09907
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A class of graphs with large rankwidth, (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels, (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth, Colouring square-free graphs without long induced paths, Graphs with polynomially many minimal separators