Recognizing graphs without asteroidal triples

DOI10.1016/j.jda.2004.04.005zbMath1118.05090MaRDI QIDQ876727

Ekkehard Köhler

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.04.005

zbMATH Keywords

graph algorithms; recognition algorithm; asteroidal triple-free graphs; knotting graph

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C75: Structural characterization of families of graphs

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Independent packings in structured graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting given length cycles
• Tolerance graphs
• A unified approach to domination problems on interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Efficient graph representations
• Triangulating graphs without asteroidal triples
• Incidence matrices and interval graphs
• Linear time algorithms for graph search and connectivity determination on complement graphs.
• Representation of a finite graph by a set of intervals on the real line
• Algorithmic Aspects of Vertex Elimination on Graphs
• Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
• Transitiv orientierbare Graphen
• A Characterization of Comparability Graphs and of Interval Graphs