Pages that link to "Item:Q2848542"
From MaRDI portal
The following pages link to Counting and detecting small subgraphs via equations (Q2848542):
Displaying 21 items.
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Finding, minimizing, and counting weighted subgraphs (Q2848203) (← links)
- Unique subgraphs are not easier to find (Q2855752) (← links)
- Detecting and Counting Small Pattern Graphs (Q2872118) (← links)
- A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
- Homomorphisms are a good basis for counting small subgraphs (Q4977973) (← links)
- Counting problems in parameterized complexity (Q5009461) (← links)
- Counting Answers to Existential Questions (Q5091275) (← links)
- Detecting and Counting Small Pattern Graphs (Q5502097) (← links)
- Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
- Faster Subgraph Counting in Sparse Graphs (Q5875538) (← links)
- Counting Subgraphs in Degenerate Graphs (Q5889797) (← links)
- Counting subgraphs via homomorphisms (Q5891745) (← links)
- Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- Monotone arithmetic complexity of graph homomorphism polynomials (Q6077890) (← links)
- Finding and counting small tournaments in large tournaments (Q6652454) (← links)
