CFI Construction and Balanced Graphs (Q5321700): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph Classes: A Survey / 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: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Counting Logics on Restricted Classes of Finite Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / 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: Logical hierarchies in PTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs / rank
 
Normal rank

Latest revision as of 18:28, 1 July 2024

scientific article; zbMATH DE number 5578467
Language Label Description Also known as
English
CFI Construction and Balanced Graphs
scientific article; zbMATH DE number 5578467

    Statements

    Identifiers