Pages that link to "Item:Q4635898"

From MaRDI portal

← Definability equals recognizability for graphs of bounded treewidth (Q4635898)

Jump to:navigation, search

The following pages link to Definability equals recognizability for graphs of bounded treewidth (Q4635898):

Displaying 1 item.

Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q4635898"