Orthogonal vector coloring

MaRDI QIDQ976703zbMATH OpenFDO

Authors Gerald Haynes, Catherine Park, Amanda Schaeffer, Lon H. Mitchell, Jordan D. Webster

Publication date 16 June 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/233268, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r55.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

chromatic numbers

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Review text

Summary: A vector coloring of a graph is an assignment of a vector to each vertex where the presence or absence of an edge between two vertices dictates the value of the inner product of the corresponding vectors. In this paper, we obtain results on orthogonal vector coloring, where adjacent vertices must be assigned orthogonal vectors. We introduce two vector analogues of list coloring along with their chromatic numbers and characterize all graphs that have (vector) chromatic number two in each case.

Recommendations

• Vector coloring the categorical product of graphs
• Orthogonal colorings of graphs
• Coloring an Orthogonality Graph
• Orthogonal colourings of Cayley graphs
• Vector colorability

Cited in

(13)

• Vector colorability
• On the subspace choosability in graphs
• Vector coloring the categorical product of graphs
• Orthonormal representations of \(H\)-free graphs
• Orthogonal representations of Steiner triple system incidence graphs
• Complexity of the positive semidefinite matrix completion problem with a rank constraint
• The replica symmetric solution for orthogonally constrained Heisenberg model on Bethe lattice
• Coloring an Orthogonality Graph
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
• Colorability in Orthogonal Graph Drawing
• Decomposing tensors via rank-one approximations
• Kernelization for orthogonality dimension
• Kernelization for orthogonality dimension

This page was built for publication: Orthogonal vector coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976703)