scientific article; zbMATH DE number 6312070

zbMATH Open1294.05071MaRDI QIDQ5167724

Peter Dukes, Gary MacGillivray, Steve Lowdon

Publication date: 1 July 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2327/0.html

Title of this publication is not available (Why is that?)

zbMATH Keywords

homomorphismgraph colouringvertex partitions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Conditional Hardness for Approximate Coloring

This page was built for publication:

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