The list distinguishing number equals the distinguishing number for interval graphs
From MaRDI portal
Publication:503677
DOI10.7151/dmgt.1927zbMath1354.05086arXiv1509.04327OpenAlexW2963950417MaRDI QIDQ503677
Publication date: 23 January 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.04327
Related Items (5)
THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ List-distinguishing Cartesian products of cliques ⋮ The list distinguishing number of Kneser graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- List-distinguishing colorings of graphs
- On computing the distinguishing numbers of trees and forests
- Cartesian powers of graphs can be distinguished by two labels
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Extending precolorings to distinguish group actions
- Symmetry breaking in graphs
- List distinguishing parameters of trees
- Distinguishing infinite graphs
- Incidence matrices and interval graphs
- The distinguishing number of Cartesian products of complete graphs
- Distinguishing colorings of Cartesian products of complete graphs
- Distinguishing labellings of group action on vector spaces and graphs
- On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- Distinguishing Cartesian powers of graphs
- Distinguishing Cartesian powers of graphs
This page was built for publication: The list distinguishing number equals the distinguishing number for interval graphs
