Distinguishing geometric graphs

DOI10.1002/JGT.20171MaRDI QIDQ3419706zbMATH OpenOpenAlexFDO

Authors Michael O. Albertson, Debra L. Boutin

Publication date 7 February 2007

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20171

zbMATH Keywords

distinguishing numbergeometric embeddingrectilinear embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Symmetry breaking in graphs
• scientific article; zbMATH DE number 1439496
• Distinguishing Cartesian powers of graphs
• Distinguishing number of countable homogeneous relational structures
• The distinguishing chromatic number
• Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs
• On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
• Using determining sets to distinguish Kneser graphs
• Distinguishing labellings of group action on vector spaces and graphs
• Trees with distinguishing index equal distinguishing number plus one

Cited in

(5)

• deBruijn-like sequences and the irregular chromatic number of paths and cycles
• Extending precolorings to distinguish group actions
• Nordhaus-Gaddum theorem for the distinguishing chromatic number
• Distinguishing number of inverse graphs of finite groups: labeling the symmetry
• Automorphisms and distinguishing numbers of geometric cliques

This page was built for publication: Distinguishing geometric graphs

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