Distinguishing infinite graphs
zbMATH Open1124.05044MaRDI QIDQ2372880FDOQ2372880
Authors: Wilfried Imrich, Sandi Klavžar, V. 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Distinguishing infinite graphs with bounded degrees
- Distinguishing homomorphisms of infinite graphs
- The distinguishing index of infinite graphs
- Bounds for distinguishing invariants of infinite graphs
- scientific article; zbMATH DE number 15866
- Decomposing infinite graphs
- scientific article; zbMATH DE number 599133
- Distinguishability of infinite groups and graphs
- scientific article; zbMATH DE number 3943869
- Publication:3204497
Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinal and cardinal numbers (03E10)
Cited In (43)
- Extending precolorings to distinguish group actions
- Breaking graph symmetries by edge colourings
- Endomorphism breaking in graphs
- Distinguishability of infinite groups and graphs
- Distinguishing number and adjacency properties
- Distinguishability of locally finite trees
- The distinguishing index of infinite graphs
- Bounds for distinguishing invariants of infinite graphs
- On distinquishing numbers
- Strongly \(n\)-e.c. graphs and independent distinguishing labellings
- The distinguishing chromatic number of Cartesian products of two complete graphs
- A rigid Urysohn-like metric space
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
- A note on computable distinguishing colorings
- Equitable distinguishing chromatic number
- Distinguishing threshold of graphs
- The cost of 2-distinguishing hypercubes
- Graphoidally independent infinite graphs
- Local finiteness, distinguishing numbers, and Tucker's conjecture
- Distinguishing number of countable homogeneous relational structures
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
- Bounding the distinguishing number of infinite graphs and permutation groups
- Distinguishing number of hierarchical products of graphs
- On asymmetric colourings of claw-free graphs
- Distinguishing graphs of maximum valence 3
- Number of distinguishing colorings and partitions
- Paint cost and the frugal distinguishing number
- Distinguishing graphs with infinite motion and nonlinear growth
- Infinite graphs with finite 2-distinguishing cost
- Distinguishing homomorphisms of infinite graphs
- Asymmetric colouring of locally compact permutation groups
- On a theorem of Halin
- Symmetry parameters for Mycielskian graphs
- Infinite motion and 2-distinguishability of graphs and groups
- Distinguishing Cartesian products of countable graphs
- The list distinguishing number equals the distinguishing number for interval graphs
- Distinguishing infinite graphs with bounded degrees
- Distinguishing orthogonality graphs
- Distinguishing number of universal homogeneous Urysohn metric spaces
- Title not available (Why is that?)
- Distinguishing generalized Mycielskian graphs
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
This page was built for publication: Distinguishing infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372880)
