Distinguishing infinite graphs

MaRDI QIDQ2372880zbMATH OpenFDO

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, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r36.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

labelingautomorphismcountable random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinal and cardinal numbers (03E10)

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

Cited in

(43)

• Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
• 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
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
• A note on computable distinguishing colorings
• A rigid Urysohn-like metric space
• Equitable distinguishing chromatic number
• The cost of 2-distinguishing hypercubes
• Distinguishing threshold of graphs
• Local finiteness, distinguishing numbers, and Tucker's conjecture
• Bounding the distinguishing number of infinite graphs and permutation groups
• Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
• Distinguishing number of countable homogeneous relational structures
• Graphoidally independent infinite graphs
• 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
• Infinite graphs with finite 2-distinguishing cost
• Distinguishing graphs with infinite motion and nonlinear growth
• Paint cost and the frugal distinguishing number
• On a theorem of Halin
• Distinguishing homomorphisms of infinite graphs
• Asymmetric colouring of locally compact permutation groups
• Distinguishing Cartesian products of countable graphs
• The list distinguishing number equals the distinguishing number for interval graphs
• Symmetry parameters for Mycielskian graphs
• Infinite motion and 2-distinguishability of graphs and groups
• Distinguishing infinite graphs with bounded degrees
• Distinguishing number of universal homogeneous Urysohn metric spaces
• Distinguishing orthogonality graphs
• scientific article; zbMATH DE number 7678748 (Why is no real title available?)
• Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)
• Distinguishing generalized Mycielskian graphs

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)