Clique-width and the speed of hereditary properties
From MaRDI portal
Publication:1010945
zbMath1182.05101MaRDI QIDQ1010945
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117311
Structural characterization of families of graphs (05C75) Asymptotic enumeration (05A16) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
Locally bounded coverings and factorial properties of graphs ⋮ Succinct data structure for path graphs ⋮ On factorial properties of chordal bipartite graphs ⋮ Implicit representations and factorial properties of graphs ⋮ The structure and the number of \(P_7\)-free bipartite graphs ⋮ Clique-width and well-quasi-ordering of triangle-free graph classes ⋮ The structure and the number of \(P_7\)-free bipartite graphs ⋮ Deciding the Bell Number for Hereditary Graph Properties ⋮ Boundary Properties of Factorial Classes of Graphs
This page was built for publication: Clique-width and the speed of hereditary properties