Distinguishing homomorphisms of infinite graphs

zbMath1317.05047arXiv1309.0416MaRDI QIDQ5499933

Dejan Delić, Anthony Bonato

Publication date: 5 August 2015

Full work available at URL: https://arxiv.org/abs/1309.0416

zbMATH Keywords

graph homomorphismdistinguishing chromatic numberpseudo-homogeneous graphuniquely \(H\)-colourable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63)

Related Items (2)

Extending precolorings to distinguish group actions ⋮ Distinguishing number of universal homogeneous Urysohn metric spaces

This page was built for publication: Distinguishing homomorphisms of infinite graphs