A class of graphs with large rankwidth

DOI10.1016/j.disc.2023.113699zbMath1525.05161arXiv2007.11513OpenAlexW4287708960MaRDI QIDQ6080165

Nicolas Trotignon, Chính T. Hoàng

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.11513

zbMATH Keywords

ringseven-hole-free graphscliquewidthDilworth numberrankwidth

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Well-quasi-order of relabel functions
• A bound on the treewidth of planar even-hole-free graphs
• Structure and algorithms for (cap, even hole)-free graphs
• Well-quasi-ordering versus clique-width
• Linear time solvable optimization problems on graphs of bounded clique-width
• Split permutation graphs
• Handle-rewriting hypergraph grammars
• Colouring diamond-free graphs
• Approximating clique-width and branch-width
• Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
• On rank-width of even-hole-free graphs
• On the structure of (pan, even hole)‐free graphs
• Clique-width for hereditary graph classes
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Bounding the Clique‐Width of H‐Free Chordal Graphs
• On low rank-width colorings
• Bounding the clique-width of \(H\)-free split graphs
• Coloring rings
• (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels

This page was built for publication: A class of graphs with large rankwidth