Pages that link to "Item:Q2403697"
From MaRDI portal
The following pages link to Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697):
Displaying 6 items.
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees (Q1578419) (← links)
- Recognizability equals definability for partial k-paths (Q4572008) (← links)
- Definability equals recognizability for graphs of bounded treewidth (Q4635898) (← links)
- Definability Equals Recognizability for $k$-Outerplanar Graphs (Q5363771) (← links)
- Orientable burning number of graphs (Q6575409) (← links)