Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality

DSpace/Manakin Repository

 
 
See more statistics about this item