Improving upper bounds for the distinguishing index

DOI10.26493/1855-3974.981.ff0zbMath1380.05028OpenAlexW2613505588MaRDI QIDQ4604514

Monika Pilśniak

Publication date: 26 February 2018

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.981.ff0

zbMATH Keywords

claw-free graphplanar graphedge colouringdistinguishing indexsymmetry breaking in graph

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (18)

An upper bound on the distinguishing index of graphs with minimum degree at least two ⋮ Extremal graphs for the distinguishing index ⋮ Distinguishing arc-colourings of symmetric digraphs ⋮ The distinguishing number (index) and the domination number of a graph ⋮ Distinguishing number and distinguishing index of strong product of two graphs ⋮ A note on breaking small automorphisms in graphs ⋮ Asymmetric edge-colorings of graphs with three colors ⋮ A bound for the distinguishing index of regular graphs ⋮ Symmetry breaking in planar and maximal outerplanar graphs ⋮ The distinguishing number and the distinguishing index of line and graphoidal graph(s) ⋮ The chromatic distinguishing index of certain graphs ⋮ Distinguishing index of maps ⋮ Distinguishing index of Kronecker product of two graphs ⋮ On asymmetric colourings of claw-free graphs ⋮ Nordhaus-Gaddum type inequalities for the distinguishing index ⋮ The distinguishing index of connected graphs without pendant edges ⋮ Distinguishing numbers of finite 4-valent vertex-transitive graphs ⋮ Proper distinguishing arc-colourings of symmetric digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nordhaus-Gaddum theorem for the distinguishing chromatic number
• Distinguishing graphs by edge-colourings
• Distinguishing Cartesian products of countable graphs
• The distinguishing chromatic number
• On a connection between the existence of k-trees and the toughness of a graph
• Claw-free graphs---a survey
• Symmetry breaking in graphs
• A survey of Nordhaus-Gaddum type relations
• The cost of 2-distinguishing Cartesian powers
• Infinite motion and 2-distinguishability of graphs and groups
• Bounds on the distinguishing chromatic number
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing colorings of Cartesian products of complete graphs
• Distinguishing Chromatic Number of Cartesian Products of Graphs
• A Theorem on Planar Graphs
• On Complementary Graphs
• Trees in Polyhedral Graphs
• Distinguishing Cartesian powers of graphs

This page was built for publication: Improving upper bounds for the distinguishing index