Pages that link to "Item:Q5395695"
From MaRDI portal
The following pages link to Fixed-point definability and polynomial time on graphs with excluded minors (Q5395695):
Displayed 15 items.
- Number of nodal domains of eigenfunctions on non-positively curved surfaces with concave boundary (Q261407) (← links)
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes (Q2922002) (← links)
- Is Polynomial Time Choiceless? (Q2947174) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs (Q5028356) (← links)
- (Q5091279) (← links)
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs (Q5092407) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925529) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925678) (← links)
- Order Reconfiguration under Width Constraints (Q6075707) (← links)