The following pages link to (Q4232773):
Displaying 13 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- Parameterized power domination complexity (Q844180) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Clique-width of partner-limited graphs (Q1422439) (← links)
- The monadic second-order logic of graphs. XII: Planar graphs and planar maps (Q1566702) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- The complexity of frugal colouring (Q2023759) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- On -sparse graphs and other families (Q3439147) (← links)
- GETGRATS (Q4923529) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
