Pages that link to "Item:Q2642907"
From MaRDI portal
The following pages link to Exact algorithms for graph homomorphisms (Q2642907):
Displaying 13 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- (Q5874546) (← links)
