Distinguishing infinite graphs
From MaRDI portal
Publication:2372880
zbMath1124.05044MaRDI QIDQ2372880
Wilfried Imrich, Sandi Klavžar, Vladimir I. Trofimov
Publication date: 16 July 2007
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/128105
Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinal and cardinal numbers (03E10)
Related Items (32)
Bounds for distinguishing invariants of infinite graphs ⋮ Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ Paint cost and the frugal distinguishing number ⋮ Equitable distinguishing chromatic number ⋮ Extending precolorings to distinguish group actions ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Distinguishing number of hierarchical products of graphs ⋮ Breaking graph symmetries by edge colourings ⋮ Local finiteness, distinguishing numbers, and Tucker's conjecture ⋮ Distinguishing orthogonality graphs ⋮ Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) ⋮ Distinguishing threshold of graphs ⋮ Endomorphism breaking in graphs ⋮ Distinguishing infinite graphs with bounded degrees ⋮ Asymmetric colouring of locally compact permutation groups ⋮ Unnamed Item ⋮ Distinguishing Cartesian products of countable graphs ⋮ The list distinguishing number equals the distinguishing number for interval graphs ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Infinite motion and 2-distinguishability of graphs and groups ⋮ The distinguishing chromatic number of Cartesian products of two complete graphs ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ Distinguishing graphs of maximum valence 3 ⋮ A note on computable distinguishing colorings ⋮ The cost of 2-distinguishing hypercubes ⋮ Bounding the distinguishing number of infinite graphs and permutation groups ⋮ On asymmetric colourings of claw-free graphs ⋮ Symmetry parameters for Mycielskian graphs ⋮ Number of distinguishing colorings and partitions ⋮ Distinguishing number of universal homogeneous Urysohn metric spaces ⋮ The distinguishing index of infinite graphs ⋮ A rigid Urysohn-like metric space
This page was built for publication: Distinguishing infinite graphs
