Distinguishing number and adjacency properties

DOI10.4310/JOC.2010.V1.N2.A4MaRDI QIDQ543989zbMATH OpenOpenAlexFDO

Authors Anthony Bonato, Dejan Delić

Publication date 14 June 2011

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/joc.2010.v1.n2.a4

zbMATH Keywords

adjacency propertydistinguishing numberhomogeneous structureinfinite random graphrelational structure

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• Distinguishing number of countable homogeneous relational structures
• Distinguishing infinite graphs
• Distinguishing homomorphisms of infinite graphs
• Bounds for distinguishing invariants of infinite graphs
• Distinguishing Cartesian products of countable graphs

Cited in

(6)

• Extending precolorings to distinguish group actions
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
• Distinguishing number of universal homogeneous Urysohn metric spaces
• Distinguishing number of countable homogeneous relational structures
• Distinguishing homomorphisms of infinite graphs
• Strongly \(n\)-e.c. graphs and independent distinguishing labellings

This page was built for publication: Distinguishing number and adjacency properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543989)