Recognizing graphs without asteroidal triples
type: Item
instance of: scholarly article
title: Recognizing graphs without asteroidal triples
zbMATH Open document ID: 1118.05090
author: Ekkehard Köhler
published in: Journal of Discrete Algorithms
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5147103
zbMATH Keywords: graph algorithms
zbMATH Keywords: asteroidal triple-free graphs
zbMATH Keywords: recognition algorithm
zbMATH Keywords: knotting graph
MaRDI profile type: Publication
full work available at URL: j.jda.2004.04.005
OpenAlex ID: W2082618417
cites work: Finding and counting given length cycles
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Q4250178
cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
cites work: Q3971999
cites work: Incidence matrices and interval graphs
cites work: Transitiv orientierbare Graphen
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Tolerance graphs
cites work: Q4944994
cites work: Linear time algorithms for graph search and connectivity determination on complement graphs.
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Triangulating graphs without asteroidal triples
cites work: A unified approach to domination problems on interval graphs
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Efficient graph representations
DOI: 10.1016/J.JDA.2004.04.005
description: scientific article; zbMATH DE number 5147103