Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)

DOI10.1007/s00605-020-01420-9zbMath1442.05058OpenAlexW3023488222MaRDI QIDQ2189429

Thomas W. Tucker, Wilfried Imrich

Publication date: 15 June 2020

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00605-020-01420-9

zbMATH Keywords

automorphismsinfinite treesasymmetric colorings

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Ordinal and cardinal numbers (03E10) Infinite graphs (05C63)

Related Items (1)

On asymmetric colourings of claw-free graphs

Cites Work

• Distinguishing maps
• Similarity and asymmetrization of trees
• The distinguishing chromatic number
• Distinguishability of locally finite trees
• Asymmetrising sets in trees
• Asymmetrization of infinite trees
• Fixed elements of infinite trees
• Symmetry breaking in graphs
• Infinite motion and 2-distinguishability of graphs and groups
• Distinguishing graphs of maximum valence 3
• Distinguishing infinite graphs
• Distinguishing graphs with intermediate growth
• Asymmetric trees with two prescribed degrees

This page was built for publication: Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)