Distinguishing graphs by edge-colourings

From MaRDI portal
Publication:482130

DOI10.1016/j.ejc.2014.11.003zbMath1304.05046OpenAlexW2072754781MaRDI QIDQ482130

Rafał Kalinowski, Monika Pilśniak

Publication date: 19 December 2014

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2014.11.003




Related Items (41)

The role of the Axiom of Choice in proper and distinguishing colouringsBounds for distinguishing invariants of infinite graphsAn upper bound on the distinguishing index of graphs with minimum degree at least twoExtremal graphs for the distinguishing indexDistinguishing arc-colourings of symmetric digraphsNumber of colors needed to break symmetries of a graph by an arbitrary edge coloringEquitable distinguishing chromatic numberThe distinguishing number and the distinguishing index of graphs from primary subgraphsThe distinguishing number and distinguishing index of the lexicographic product of two graphsThe distinguishing number (index) and the domination number of a graphDistinguishing number and distinguishing index of strong product of two graphsTrees with distinguishing index equal distinguishing number plus oneBreaking graph symmetries by edge colouringsA note on breaking small automorphisms in graphsAsymmetric edge-colorings of graphs with three colorsDistinguishing threshold of graphsThe distinguishing index of graphs with infinite minimum degreeDistinguishing numbers and distinguishing indices of oriented graphsA bound for the distinguishing index of regular graphsImproving upper bounds for the distinguishing indexUnnamed ItemSymmetry breaking in planar and maximal outerplanar graphsDistinguishing index of graphs with simple automorphism groupsThe distinguishing number and the distinguishing index of line and graphoidal graph(s)The chromatic distinguishing index of certain graphsEdge motion and the distinguishing indexDistinguishing index of mapsDistinguishing graphs of maximum valence 3Distinguishing index of Kronecker product of two graphsOn asymmetric colourings of claw-free graphsNordhaus-Gaddum type inequalities for the distinguishing indexThe distinguishing index of connected graphs without pendant edgesOn symmetries of edge and vertex colourings of graphsNumber of distinguishing colorings and partitionsProper distinguishing arc-colourings of symmetric digraphsEdge-distinguishing of star-free graphsOn the distinguishing number of functigraphsThe distinguishing index of infinite graphsDistinguishing number and distinguishing index of neighbourhood corona of two graphsDistinguishing number and distinguishing index of certain graphsPrecise bounds for the distinguishing index of the Cartesian product



Cites Work




This page was built for publication: Distinguishing graphs by edge-colourings