Clique-width of countable graphs: a compactness property

zbMATH Open1412.05149MaRDI QIDQ2816072FDOQ2816072

Authors: Bruno Courcelle 

Publication date: 1 July 2016

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065305801295?np=y

Recommendations

• Clique-width of countable graphs: A compactness property.
• Several notions of rank-width for countable graphs
• A model-theoretic characterisation of clique width
• Clique-width of partner-limited graphs
• Critical properties of graphs of bounded clique-width

zbMATH Keywords

compactnessclique-widthcountable graphcograph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (6)

• Graph operations, graph transformations and monadic second-order logic: a survey
• Compact representation of graphs of small clique-width
• Clique-width of countable graphs: A compactness property.
• A model-theoretic characterisation of clique width
• Several notions of rank-width for countable graphs
• Title not available (Why is that?)

This page was built for publication: Clique-width of countable graphs: a compactness property

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