Note on projective graphs
From MaRDI portal
Recommendations
Cited in
(17)- Dichotomy for bounded degree \(H\)-colouring
- Unordered love in infinite directed graphs
- On the extension of vertex maps to graph homomorphisms
- Projectivity and independent sets in powers of graphs
- scientific article; zbMATH DE number 4105023 (Why is no real title available?)
- Colouring, constraint satisfaction, and complexity
- A note on projective norm graphs
- Rigid binary relations on a 4-element domain
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- New perspectives on semiring applications to dynamic programming
- Towards tight bounds for the graph homomorphism problem parameterized by cutwidth via asymptotic matrix parameters
- The fine-grained complexity of graph homomorphism parameterized by clique-width
- Fine-grained complexity of the list homomorphism problem: feedback vertex set and cutwidth
- Minimal obstructions to C₅-Coloring in hereditary graph classes
- Minimal obstructions to C₅-coloring in hereditary graph classes
- In praise of homomorphisms
- When is a random graph projective?
This page was built for publication: Note on projective graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159392)