Clique-width and well-quasi-ordering of triangle-free graph classes
From MaRDI portal
Publication:5915794
DOI10.1007/978-3-319-68705-6_17zbMath1483.05178arXiv1711.08837OpenAlexW2983930721MaRDI QIDQ5915794
Daniël Paulusma, Konrad K. Dabrowski, Vadim V. Lozin
Publication date: 4 January 2018
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.08837
Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Well-quasi-ordering versus clique-width: new results on bigenic classes, Clique-width and well-quasi-ordering of triangle-free graph classes, Unnamed Item