The following pages link to (Q3912037):
Displayed 15 items.
- Super connectivity of Kronecker product of complete bipartite graphs and complete graphs (Q279219) (← links)
- On the super connectivity of Kronecker products of graphs (Q436343) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- Vertex vulnerability parameters of Kronecker products of complete graphs (Q963383) (← links)
- Dichotomy for bounded degree \(H\)-colouring (Q1003659) (← links)
- On the complexity of H-coloring (Q1100215) (← links)
- Polynomial graph-colorings (Q1183345) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs (Q1913439) (← links)
- Coloring graph products---a survey (Q1923489) (← links)
- The super edge connectivity of Kronecker product graphs (Q4553888) (← links)
- Polynomial graph-colorings (Q5096147) (← links)
- (Q6065467) (← links)