Recognizing graphs without asteroidal triples

DOI10.1016/J.JDA.2004.04.005MaRDI QIDQ876727zbMATH OpenOpenAlexFDO

Authors 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

asteroidal triple-free graphsgraph algorithmsknotting graphrecognition algorithm

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1696539
• Independent sets in asteroidal triple-free graphs
• Independent Sets in Asteroidal Triple-Free Graphs
• On claw-free asteroidal triple-free graphs
• Publication:4944994

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• A unified approach to domination problems on interval graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Efficient graph representations
• Finding and counting given length cycles
• scientific article; zbMATH DE number 15355 (Why is no real title available?)
• scientific article; zbMATH DE number 1303554 (Why is no real title available?)
• scientific article; zbMATH DE number 1420922 (Why is no real title available?)
• Incidence matrices and interval graphs
• Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free 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
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Tolerance graphs
• Transitiv orientierbare Graphen
• Triangulating graphs without asteroidal triples

Cited in

(13)

• Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
• On efficient domination for some classes of H-free bipartite graphs
• Independent packings in structured graphs
• scientific article; zbMATH DE number 1696539 (Why is no real title available?)
• Colouring AT-free graphs
• Vertex ordering characterizations of graphs of bounded asteroidal number
• scientific article; zbMATH DE number 1420922 (Why is no real title available?)
• Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
• Quasimonotone graphs
• Graph classes and the switch Markov chain for matchings
• Approximating the bandwidth for asteroidal triple-free graphs
• Axiomatic characterization of the toll walk function of some graph classes
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

This page was built for publication: Recognizing graphs without asteroidal triples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876727)