scientific article; zbMATH DE number 434895

MaRDI QIDQ3139749zbMATH OpenFDO

Authors Bruce L. Bauslaugh

Publication date 8 June 1994

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)

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

Cited in

(5)

• Graph homomorphisms with infinite targets
• Explicit homomorphisms of hexagonal graphs to one vertex deleted Petersen graph
• scientific article; zbMATH DE number 4162940 (Why is no real title available?)
• 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)