On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
type: Item
instance of: scholarly article
title: On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
zbMATH Open document ID: 1213.05071
author: Christine T. Cheng
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5648058
zbMATH Keywords: distinguishing numbers
zbMATH Keywords: distinguishing chromatic numbers
zbMATH Keywords: interval graphs
zbMATH Keywords: PQ-trees
MaRDI profile type: Publication
full work available at URL: j.disc.2009.04.004
OpenAlex ID: W2122327283
cites work: Q4091421
cites work: Symmetry breaking in graphs
cites work: On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
cites work: The distinguishing number of the hypercube
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: The distinguishing number of the augmented cube and hypercube powers
cites work: On computing the distinguishing numbers of trees and forests
cites work: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
cites work: The distinguishing chromatic number
cites work: Incidence matrices and interval graphs
cites work: Q4198056
cites work: Q3328583
cites work: $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
cites work: A note on the asymptotic and computational complexity of graph distinguishability
DOI: 10.1016/J.DISC.2009.04.004
description: scientific article; zbMATH DE number 5648058