scientific article; zbMATH DE number 434895

zbMATH Open0791.05035MaRDI QIDQ3139749FDOQ3139749

Bruce L. Bauslaugh

Publication date: 8 June 1994

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

Recommendations

• The complexity of infinite \(H\)-colouring
• Graph homomorphisms with infinite targets
• On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs
• Surjective \(H\)-colouring: new hardness results
• scientific article; zbMATH DE number 1151810

zbMATH Keywords

complexitycolouringhomomorphism probleminfinite vertex transitive graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cited In (5)

• Graph homomorphisms with infinite targets
• Explicit homomorphisms of hexagonal graphs to one vertex deleted Petersen graph
• Title not available (Why is that?)
• On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs
• The complexity of infinite \(H\)-colouring

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 Q3139749)