Almost all graphs are rigid-revisited
type: Item
instance of: scholarly article
title: Almost all graphs are rigid-revisited
zbMATH Open document ID: 1200.05102
author: Jens Kötters
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 5647988
zbMATH Keywords: almost all graphs
zbMATH Keywords: rigid graphs
zbMATH Keywords: unretractive graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2008.11.031
OpenAlex ID: W2175403806
cites work: Q4871775
cites work: Asymmetric graphs
cites work: Q5682013
cites work: Symmetric relations (undirected graphs) with given semigroups
cites work: On Rigid Undirected Graphs
cites work: Q5554159
cites work: Q4828516
cites work: Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
cites work: On the minimum order of graphs with given semigroup
DOI: 10.1016/J.DISC.2008.11.031
description: scientific article; zbMATH DE number 5647988