A note on restricted \(H\)-colouring

DOI10.1016/0020-0190(91)90171-DzbMath0761.05039OpenAlexW2038944411MaRDI QIDQ1183461

Gary MacGillivray, Richard C. Brewster

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90171-d

zbMATH Keywords

computational complexitygraph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Graph homomorphisms with infinite targets ⋮ The complexity of restricted graph homomorphisms ⋮ On the restricted homomorphism problem

Cites Work

• On the complexity of H-coloring
• Pair Labellings with Given Distance

This page was built for publication: A note on restricted \(H\)-colouring