Clique-width of countable graphs: A compactness property. (Q1422417): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import recommendations run Q6767936
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. X: Linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the models of decidable monadic theories of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(03)00303-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114915973 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Q2816072 / rank
 
Normal rank
Property / Recommended article: Q2816072 / qualifier
 
Similarity Score: 0.9887748
Amount0.9887748
Unit1
Property / Recommended article: Q2816072 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Clique-Width for Graph Classes Closed under Complementation / rank
 
Normal rank
Property / Recommended article: Clique-Width for Graph Classes Closed under Complementation / qualifier
 
Similarity Score: 0.9042496
Amount0.9042496
Unit1
Property / Recommended article: Clique-Width for Graph Classes Closed under Complementation / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5111290 / rank
 
Normal rank
Property / Recommended article: Q5111290 / qualifier
 
Similarity Score: 0.9042496
Amount0.9042496
Unit1
Property / Recommended article: Q5111290 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / Recommended article: Upper bounds to the clique width of graphs / qualifier
 
Similarity Score: 0.9004095
Amount0.9004095
Unit1
Property / Recommended article: Upper bounds to the clique width of graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Critical properties of graphs of bounded clique-width / rank
 
Normal rank
Property / Recommended article: Critical properties of graphs of bounded clique-width / qualifier
 
Similarity Score: 0.8978748
Amount0.8978748
Unit1
Property / Recommended article: Critical properties of graphs of bounded clique-width / qualifier
 
Property / Recommended article
 
Property / Recommended article: Several notions of rank-width for countable graphs / rank
 
Normal rank
Property / Recommended article: Several notions of rank-width for countable graphs / qualifier
 
Similarity Score: 0.8906964
Amount0.8906964
Unit1
Property / Recommended article: Several notions of rank-width for countable graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: The relative clique-width of a graph / rank
 
Normal rank
Property / Recommended article: The relative clique-width of a graph / qualifier
 
Similarity Score: 0.8899243
Amount0.8899243
Unit1
Property / Recommended article: The relative clique-width of a graph / qualifier
 
Property / Recommended article
 
Property / Recommended article: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / Recommended article: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / qualifier
 
Similarity Score: 0.8846334
Amount0.8846334
Unit1
Property / Recommended article: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / qualifier
 
Property / Recommended article
 
Property / Recommended article: Clique-width of graphs defined by one-vertex extensions / rank
 
Normal rank
Property / Recommended article: Clique-width of graphs defined by one-vertex extensions / qualifier
 
Similarity Score: 0.8836669
Amount0.8836669
Unit1
Property / Recommended article: Clique-width of graphs defined by one-vertex extensions / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4949812 / rank
 
Normal rank
Property / Recommended article: Q4949812 / qualifier
 
Similarity Score: 0.87839997
Amount0.87839997
Unit1
Property / Recommended article: Q4949812 / qualifier
 
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:41, 4 April 2025

scientific article
Language Label Description Also known as
English
Clique-width of countable graphs: A compactness property.
scientific article

    Statements

    Clique-width of countable graphs: A compactness property. (English)
    0 references
    0 references
    14 February 2004
    0 references
    Countable graph
    0 references
    Clique-width
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references