David E. Roberson

Math. Program., May, 2024

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability.

[BibT_eX]

[DOI]

Tim Seppelt

TheoretiCS, 2024

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability.

[BibT_eX]

[DOI]

CoRR, 2024

2020

Vector coloring the categorical product of graphs.

[BibT_eX]

[DOI]

Math. Program., 2020

Cores of cubelike graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Quantum and non-signalling graph isomorphisms.

[BibT_eX]

[DOI]

Marcel Kenji de Carli Silva

J. Comb. Theory B, 2019

Algebras, Graphs and Thetas.

[BibT_eX]

[DOI]

Gabriel Coutinho

Chris D. Godsil

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Graph homomorphisms via vector colorings.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

2017

Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

A new property of the Lovász number and duality relations between graph parameters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Relaxations of Graph Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Quantum homomorphisms.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Homomorphisms of Strongly Regular Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Fractional zero forcing via three-color forcing games.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Sabidussi versus Hedetniemi for three variations of the chromatic number.

[BibT_eX]

[DOI]

Comb., 2016

On deciding the existence of perfect entangled strategies for nonlocal games.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2016

Oddities of Quantum Colorings.

[BibT_eX]

[DOI]

Balt. J. Mod. Comput., 2016

2015

Graph Cores via Universal Completability.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

2014

Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Graph Homomorphisms for Quantum Players.

[BibT_eX]

[DOI]

Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants.

[BibT_eX]

[DOI]

Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

2013

Cores of Vertex Transitive Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

Häggkvist-Hell graphs: A class of Kneser-colorable graphs.

[BibT_eX]

[DOI]