Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
type: Item
instance of: scholarly article
title: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
zbMATH Open document ID: 1056.05099
author: Ryuhei Uehara
author: Takayuki Nagoya
author: Seinosuke Toda
published in: Discrete Applied Mathematics
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 2137497
zbMATH Keywords: Graph isomorphism problem
zbMATH Keywords: Graph isomorphism complete
zbMATH Keywords: Strongly chordal graphs
zbMATH Keywords: Chordal bipartite graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2004.06.008
OpenAlex ID: W2152515622
cites work: Graph Isomorphism is in SPP
cites work: The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
cites work: Graph Classes: A Survey
cites work: Graph isomorphism and identification matrices: Sequential algorithms
cites work: Interval bigraphs and circular arc graphs
cites work: $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
cites work: Q4273947
cites work: A note on the graph isomorphism counting problem
cites work: The graph isomorphism disease
cites work: Efficient graph representations
DOI: 10.1016/J.DAM.2004.06.008
description: scientific article; zbMATH DE number 2137497