The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986313631 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0401361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Outerplanar Graphs Uniformly at Random / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal lower bound on the number of variables for graph identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of games to the completeness problem for formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3230355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separator theorem for graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism testing for embeddable graphs through definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability with bounded number of bound variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: How complex are random graphs in first order logic? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct definitions in the first order theory of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first order definability of graphs: Upper bounds for quantifier depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strange logic of random graphs / rank
 
Normal rank

Latest revision as of 17:58, 10 June 2024

scientific article
Language Label Description Also known as
English
The first order definability of graphs with separators via the Ehrenfeucht game
scientific article

    Statements

    The first order definability of graphs with separators via the Ehrenfeucht game (English)
    0 references
    26 October 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graphs
    0 references
    first-order definability
    0 references
    Ehrenfeucht game
    0 references
    graph separators
    0 references
    0 references
    0 references
    0 references