On the public citation graph

Orthogonal Vector Coloring

https://doi.org/10.37236/327
0 signed · 54 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118032497openalex-snapshot
Graph Coloring Problems
inferredcites →https://doi.org/10.1002/9781118032718.scardopenalex-snapshot
Wiley‐Interscience Series in Discrete Mathematics and Optimization
inferredcites →https://doi.org/10.1006/jctb.1994.1062openalex-snapshot
Every Planar Graph Is 5-Choosable
inferredcites →https://doi.org/10.1007/978-0-8176-4580-9openalex-snapshot
A Beginner’s Guide to Graph Theory
inferredcites →https://doi.org/10.1007/978-1-4757-3134-7openalex-snapshot
A Beginner’s Guide to Graph Theory
inferredcites →https://doi.org/10.1007/978-3-0348-9259-9_14openalex-snapshot
Die Logik Nicht Gleichzeitig Entscheidbarer Aussagen
inferredcites →https://doi.org/10.1007/978-3-0348-9259-9_19openalex-snapshot
Logical Structures Arising in Quantum Theory
inferredcites →https://doi.org/10.1007/978-3-0348-9259-9_20openalex-snapshot
The Calculus of Partial Propositional Functions
inferredcites →https://doi.org/10.1007/978-94-010-1795-4_15openalex-snapshot
Logical Structures Arising in Quantum Theory
inferredcites →https://doi.org/10.1007/978-94-010-1795-4_17openalex-snapshot
The Problem of Hidden Variables in Quantum Mechanics
inferredcites →https://doi.org/10.1007/bf01261326openalex-snapshot
Orthogonal representations over finite fields and the chromatic number of graphs
inferredcites →https://doi.org/10.1007/bf02351595openalex-snapshot
Sets of vectors with many orthogonal paris:
inferredcites →https://doi.org/10.1007/pl00021187openalex-snapshot
Large Sets of Nearly Orthogonal Vectors
inferredcites →https://doi.org/10.1007/s002470050167openalex-snapshot
A short story
inferredcites →https://doi.org/10.1016/0012-365x(89)90171-4openalex-snapshot
Vector representations of graphs
inferredcites →https://doi.org/10.1016/0012-365x(91)90125-lopenalex-snapshot
A note on vector representation of graphs
inferredcites →https://doi.org/10.1016/0024-3795(89)90475-8openalex-snapshot
Orthogonal representations and connectivity of graphs
inferredcites →https://doi.org/10.1016/0375-9601(96)00134-xopenalex-snapshot
Bell-Kochen-Specker theorem: A proof with 18 vectors
inferredcites →https://doi.org/10.1016/j.laa.2007.10.031openalex-snapshot
Unitary matrix digraphs and minimum semidefinite rank
inferredcites →https://doi.org/10.1016/s0012-365x(00)00168-0openalex-snapshot
On orthogonal representations of graphs
inferredcites →https://doi.org/10.1016/s0012-365x(00)00208-9openalex-snapshot
I. Schur, C.E. Shannon and Ramsey Numbers, a short story
inferredcites →https://doi.org/10.1016/s0024-3795(00)00091-4openalex-snapshot
A correction: orthogonal representations and connectivity of graphs
inferredcites →https://doi.org/10.1016/s0925-7721(97)00012-6openalex-snapshot
Geometric representations of graphs
inferredcites →https://doi.org/10.1017/cbo9780511626265openalex-snapshot
Fourier Analysis on Finite Groups and Applications
inferredcites →https://doi.org/10.1088/0305-4470/24/4/003openalex-snapshot
Two simple proofs of the Kochen-Specker theorem
inferredcites →https://doi.org/10.1103/revmodphys.38.447openalex-snapshot
On the Problem of Hidden Variables in Quantum Mechanics
inferredcites →https://doi.org/10.1109/sfcs.2002.1181951openalex-snapshot
Graphs with tiny vector chromatic numbers and huge chromatic numbers
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1111/j.1746-8361.1960.tb00422.xopenalex-snapshot
Die Logik nicht gleichzeitig entscheidbarer Aussagen
inferredcites →https://doi.org/10.1112/s0024609300227355openalex-snapshot
FOURIER ANALYSIS ON FINITE GROUPS AND APPLICATIONS (London Mathematical Society Student Texts 43)
inferredcites →https://doi.org/10.1137/s0097539703431391openalex-snapshot
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
inferredcites →https://doi.org/10.1137/s0895479802410293openalex-snapshot
On the Digraph of a Unitary Matrix
inferredcites →https://doi.org/10.1142/9789812386540_0001openalex-snapshot
On the Problem of Hidden Variables in Quantum Mechanics
inferredcites →https://doi.org/10.1145/274787.274791openalex-snapshot
Approximate graph coloring by semidefinite programming
inferredcites →https://doi.org/10.1512/iumj.1968.17.17004openalex-snapshot
The Problem of Hidden Variables in Quantum Mechanics
inferredcites →https://doi.org/10.2307/2306658openalex-snapshot
On Complementary Graphs
inferredcites →https://doi.org/10.37236/999openalex-snapshot
On the Quantum Chromatic Number of a Graph
inferredcites →https://doi.org/10.5860/choice.32-6283openalex-snapshot
Graph coloring problems
inferredcites →https://doi.org/10.5860/choice.37-6316openalex-snapshot
Fourier analysis on finite groups and applications
inferredcites →https://doi.org/10.5860/choice.42-2854bopenalex-snapshot
Handbook of graph theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_7openalex-snapshot
Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint
inferred← citeshttps://doi.org/10.1007/s00454-020-00185-0openalex-snapshot
Orthonormal Representations of H-Free Graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.07.009openalex-snapshot
Orthogonal representations of Steiner triple system incidence graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103757openalex-snapshot
Kernelization for orthogonality dimension
inferred← citeshttps://doi.org/10.1088/1751-8121/aa54d2openalex-snapshot
The replica symmetric solution for orthogonally constrained Heisenberg model on Bethe lattice
inferred← citeshttps://doi.org/10.1109/cdc.2011.6160280openalex-snapshot
Consensus on nonlinear spaces and graph coloring
inferred← citeshttps://doi.org/10.1109/tit.2018.2833466openalex-snapshot
Complexity and Capacity Bounds for Quantum Channels
inferred← citeshttps://doi.org/10.1137/24m1715106openalex-snapshot
Decomposing Tensors via Rank-One Approximations
inferred← citeshttps://doi.org/10.13001/1081-3810.1400openalex-snapshot
On the minimum vector rank of multigraphs
inferred← citeshttps://doi.org/10.13001/1081-3810.1606openalex-snapshot
Minimum vector rank and complement critical graphs
inferred← citeshttps://doi.org/10.37236/10765openalex-snapshot
On the Subspace Choosability in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6602openalex-snapshot
Complexity of the positive semidefinite matrix completion problem with a rank constraint
inferred← citeshttps://doi.org/10.48550/arxiv.1909.01918openalex-snapshot
On Orthogonal Vector Edge Coloring
inferred← citeshttps://doi.org/10.7151/dmgt.1835openalex-snapshot
Unified spectral bounds on the chromatic number
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.