Clique-width and the speed of hereditary properties

zbMATH Open1182.05101MaRDI QIDQ1010945FDOQ1010945

Authors J. Martínez

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

clique-widthhereditary class of graphsrates of growthdiscrete layersspeed of hereditary classes

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Asymptotic enumeration (05A16) Structural characterization of families of graphs (05C75)

Recommendations

• Clique-width for hereditary graph classes
• scientific article; zbMATH DE number 1979486
• Linear clique-width for hereditary classes of cographs
• Infinitely many minimal classes of graphs of unbounded clique-width
• Clique-width for graph classes closed under complementation

Cited in

(17)

• Uncountably many minimal hereditary classes of graphs of unbounded clique-width
• Implicit representations and factorial properties of graphs
• Boundary properties of factorial classes of graphs
• Clique-width for hereditary graph classes
• Linear clique-width for hereditary classes of cographs
• On factorial properties of chordal bipartite graphs
• Succinct data structure for path graphs
• Deciding the Bell number for hereditary graph properties
• Locally bounded coverings and factorial properties of graphs
• Faster recognition of clique-Helly and hereditary clique-Helly graphs
• A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width
• Infinitely many minimal classes of graphs of unbounded clique-width
• Clique-width and well-quasi-ordering of triangle-free graph classes
• scientific article; zbMATH DE number 1979486 (Why is no real title available?)
• The structure and the number of \(P_7\)-free bipartite graphs
• The structure and the number of \(P_7\)-free bipartite graphs
• Small but unwieldy: a lower bound on adjacency labels for small classes

This page was built for publication: Clique-width and the speed of hereditary properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010945)