The following pages link to Orthogonal vector coloring (Q976703):
Displaying 10 items.
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix (Q396873) (← links)
- Vector colorability (Q1100473) (← links)
- On the subspace choosability in graphs (Q2138578) (← links)
- Vector coloring the categorical product of graphs (Q2191770) (← links)
- Orthonormal representations of \(H\)-free graphs (Q2207591) (← links)
- Orthogonal representations of Steiner triple system incidence graphs (Q2404398) (← links)
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
- The replica symmetric solution for orthogonally constrained Heisenberg model on Bethe lattice (Q2965758) (← links)
- Coloring an Orthogonality Graph (Q3629469) (← links)
- Colorability in Orthogonal Graph Drawing (Q5452235) (← links)
