CFI Construction and Balanced Graphs

DOI10.1007/978-3-642-02270-8_12zbMath1248.68228OpenAlexW1510891748MaRDI QIDQ5321700

No author found.

Publication date: 14 July 2009

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal lower bound on the number of variables for graph identification
• Graph searching and a min-max theorem for tree-width
• Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
• Logical hierarchies in PTIME
• Structure and complexity of relational queries
• Algorithmic graph theory and perfect graphs
• Isomorphism testing for embeddable graphs through definability
• The Power of Counting Logics on Restricted Classes of Finite Structures
• Graph Classes: A Survey

This page was built for publication: CFI Construction and Balanced Graphs