Pages that link to "Item:Q2380449"
From MaRDI portal
The following pages link to Graph powers and graph homomorphisms (Q2380449):
Displaying 22 items.
- On cylindrical graph construction and its applications (Q252833) (← links)
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- Clawfreeness of the powers of a graph (Q423974) (← links)
- Digraph functors which admit both left and right adjoints (Q488275) (← links)
- Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← links)
- Cartesian powers of graphs can be distinguished by two labels (Q854831) (← links)
- Some relations between power graphs and Cayley graphs (Q900515) (← links)
- Density and power graphs in graph homomorphism problem (Q932664) (← links)
- \(\mathbb{Z}_2\)-indices and Hedetniemi's conjecture (Q2324631) (← links)
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture (Q2338641) (← links)
- On the odd girth and the circular chromatic number of generalized Petersen graphs (Q2359794) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Iterated open neighborhood graphs and generalizations (Q2446342) (← links)
- On the circular chromatic number of graph powers (Q2874089) (← links)
- The inner power of a graph (Q3085028) (← links)
- Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon (Q3503218) (← links)
- Hedetniemi's Conjecture and Strongly Multiplicative Graphs (Q5244123) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
- (Q5753991) (← links)
- Generalized Powers of Graphs and Their Algorithmic Use (Q5757881) (← links)
- Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices (Q5878469) (← links)
- A generalization of Kneser's conjecture (Q5891501) (← links)
