Pages that link to "Item:Q1110530"
From MaRDI portal
The following pages link to On multiplicative graphs and the product conjecture (Q1110530):
Displaying 36 items.
- Square-free graphs are multiplicative (Q345100) (← links)
- Foldings in graphs and relations with simplicial complexes and posets (Q442383) (← links)
- Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- The effect of two cycles on the complexity of colourings by directed graphs (Q911612) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- On the complexity of H-coloring (Q1100215) (← links)
- On multiplicative graphs and the product conjecture (Q1110530) (← links)
- A simple proof of the multiplicativity of directed cycles of prime power length (Q1193732) (← links)
- Multiplicative posets (Q1198481) (← links)
- Achromatic numbers and graph operations (Q1201263) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- Compactness and finite equivalence of infinite digraphs (Q1356449) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- Multiplicativity of acyclic digraphs (Q1377696) (← links)
- Chromatic Ramsey numbers (Q1584391) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- Lattices arising in categorial investigations of Hedetniemi's conjecture (Q1917488) (← links)
- Star-extremal graphs and the lexicographic product (Q1917490) (← links)
- Coloring graph products---a survey (Q1923489) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- Duality pairs and homomorphisms to oriented and unoriented cycles (Q2048544) (← links)
- Note on Hedetniemi's conjecture and the Poljak-Rödl function (Q2058954) (← links)
- Relatively small counterexamples to Hedetniemi's conjecture (Q2221923) (← links)
- Counterexamples to Hedetniemi's conjecture (Q2274002) (← links)
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture (Q2338641) (← links)
- Multiplicative graphs and semi-lattice endomorphisms in the category of graphs (Q2573651) (← links)
- CSP DICHOTOMY FOR SPECIAL POLYADS (Q2852579) (← links)
- CSP dichotomy for special triads (Q3395563) (← links)
- Minimum Cost Homomorphism Dichotomy for Oriented Cycles (Q3511431) (← links)
- Path homomorphisms (Q4892428) (← links)
- Hedetniemi's Conjecture and Strongly Multiplicative Graphs (Q5244123) (← links)
- Learning logic programs with structured background knowledge (Q5941133) (← links)
- Semidefinite programming and its applications to NP problems (Q6085755) (← links)
