Distinguishing maps
From MaRDI portal
Publication:540028
zbMath1220.05134MaRDI QIDQ540028
Publication date: 1 June 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/229861
Planar graphs; geometric and topological aspects of graph theory (05C10) Group actions on combinatorial structures (05E18)
Related Items (22)
Bounds for distinguishing invariants of infinite graphs ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Distinguishing graphs with intermediate growth ⋮ Breaking graph symmetries by edge colourings ⋮ Local finiteness, distinguishing numbers, and Tucker's conjecture ⋮ Nordhaus-Gaddum theorem for the distinguishing chromatic number ⋮ 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 ⋮ 3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions ⋮ Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions ⋮ Unnamed Item ⋮ Infinite motion and 2-distinguishability of graphs and groups ⋮ Distinguishing index of maps ⋮ Distinguishing graphs of maximum valence 3 ⋮ On asymmetric colourings of claw-free graphs ⋮ The distinguishing numbers of graphs on closed surfaces ⋮ On symmetries of edge and vertex colourings of graphs ⋮ The distinguishing index of infinite graphs ⋮ Coarse distinguishability of graphs with symmetric growth
This page was built for publication: Distinguishing maps
