Symmetry breaking in graphs
From MaRDI portal
Publication:1918875
zbMath0851.05088MaRDI QIDQ1918875
Karen L. Collins, Michael O. Albertson
Publication date: 21 July 1996
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/118910
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Special aspects of infinite or finite groups (20F99)
Related Items (only showing first 100 items - show all)
A note on adjacent vertex distinguishing colorings of graphs ⋮ THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH ⋮ Bounds for distinguishing invariants of infinite graphs ⋮ Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density ⋮ Generation of Colourings and Distinguishing Colourings of Graphs ⋮ An upper bound on the distinguishing index of graphs with minimum degree at least two ⋮ Distinguishing arc-colourings of symmetric digraphs ⋮ Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ Effective storage capacity of labeled graphs ⋮ Equitable distinguishing chromatic number ⋮ Extending precolorings to distinguish group actions ⋮ The distinguishing number and the distinguishing index of graphs from primary subgraphs ⋮ A proof of Pyber's base size conjecture ⋮ Cartesian powers of graphs can be distinguished by two labels ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ The distinguishing number and distinguishing index of the lexicographic product of two graphs ⋮ Destroying automorphisms by fixing nodes ⋮ The distinguishing number (index) and the domination number of a graph ⋮ Distinguishing graphs with intermediate growth ⋮ Distinguishing number and distinguishing index of strong product of two graphs ⋮ Distinguishing number of hierarchical products of graphs ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ Breaking graph symmetries by edge colourings ⋮ Trees with distinguishing number two ⋮ Rigidity and separation indices of graphs in surfaces ⋮ On the automorphic chromatic index of a graph ⋮ A note on breaking small automorphisms in graphs ⋮ Reconstructing a minimal topological dynamical system from a set of return times ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ Local finiteness, distinguishing numbers, and Tucker's conjecture ⋮ Asymmetric edge-colorings of graphs with three colors ⋮ Nordhaus-Gaddum theorem for the distinguishing chromatic number ⋮ On a theorem of Halin ⋮ Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) ⋮ Endomorphism breaking in graphs ⋮ List-distinguishing Cartesian products of cliques ⋮ The list distinguishing number of Kneser graphs ⋮ On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two ⋮ The distinguishing number of Cartesian products of complete graphs ⋮ Distinguishing numbers and distinguishing indices of oriented graphs ⋮ A bound for the distinguishing index of regular graphs ⋮ Orbit equivalence and permutation groups defined by unordered relations. ⋮ Improving upper bounds for the distinguishing index ⋮ Unnamed Item ⋮ Symmetry breaking in planar and maximal outerplanar graphs ⋮ On the fixing number of functigraphs ⋮ Distinguishing graphs by edge-colourings ⋮ Stabilizing the distinguishing number of a graph ⋮ Automorphisms and distinguishing numbers of geometric cliques ⋮ Infinite graphs with finite 2-distinguishing cost ⋮ Distinguishing index of graphs with simple automorphism groups ⋮ Distinguishing Cartesian products of countable graphs ⋮ The list distinguishing number equals the distinguishing number for interval graphs ⋮ The distinguishing number and the distinguishing index of line and graphoidal graph(s) ⋮ The chromatic distinguishing index of certain graphs ⋮ Pairings and related symmetry notions ⋮ Edge motion and the distinguishing index ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Infinite motion and 2-distinguishability of graphs and groups ⋮ Distinguishing colorings of Cartesian products of complete graphs ⋮ The distinguishing number of the augmented cube and hypercube powers ⋮ Unnamed Item ⋮ The distinguishing chromatic number of Cartesian products of two complete graphs ⋮ Distinguishing index of maps ⋮ Graphs and their associated inverse semigroups ⋮ Distinguishing chromatic number of random Cayley graphs ⋮ Asymmetric colorings of products of graphs and digraphs ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ Distinguishing graphs of maximum valence 3 ⋮ A note on computable distinguishing colorings ⋮ The distinguishing number of the direct product and wreath product action. ⋮ Distinguishing labellings of group action on vector spaces and graphs ⋮ The cost of 2-distinguishing hypercubes ⋮ Distinguishing index of Kronecker product of two graphs ⋮ On the local distinguishing chromatic number ⋮ Upper bounds for the automorphic chromatic index of a graph ⋮ Bounding the distinguishing number of infinite graphs and permutation groups ⋮ On asymmetric colourings of claw-free graphs ⋮ The determining number of a Cartesian product ⋮ Distinguishing labeling of group actions ⋮ The distinguishing numbers of graphs on closed surfaces ⋮ Unnamed Item ⋮ Symmetry parameters for Mycielskian graphs ⋮ The distinguishing number of the hypercube ⋮ On symmetries of edge and vertex colourings of graphs ⋮ Number of distinguishing colorings and partitions ⋮ Distinguishing numbers of finite 4-valent vertex-transitive graphs ⋮ Proper distinguishing arc-colourings of symmetric digraphs ⋮ On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results ⋮ deBruijn-like sequences and the irregular chromatic number of paths and cycles ⋮ Edge-distinguishing of star-free graphs ⋮ On the local distinguishing numbers of cycles ⋮ The distinguishing number and distinguishing chromatic number for posets ⋮ Distinguishing number of universal homogeneous Urysohn metric spaces ⋮ On the distinguishing number of functigraphs ⋮ The distinguishing index of infinite graphs ⋮ Coarse distinguishability of graphs with symmetric growth ⋮ Distinguishing number and distinguishing index of neighbourhood corona of two graphs ⋮ Distinguishing number and distinguishing index of certain graphs ⋮ Precise bounds for the distinguishing index of the Cartesian product
This page was built for publication: Symmetry breaking in graphs
