Title of article
Clique-width of countable graphs: a compactness property
Author/Authors
Courcelle، نويسنده , , Bruno، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
2
From page
75
To page
76
Abstract
We define the clique-width of a countable graph. We prove that a countable graph has finite clique-width iff its finite induced subgraphs have clique-width at most k for some integer k.
Keywords
Cograph , clique-width , countable graph , compactness
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2000
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452830
Link To Document