Recognizing graphs without asteroidal triples
From MaRDI portal
Publication:876727
DOI10.1016/j.jda.2004.04.005zbMath1118.05090OpenAlexW2082618417MaRDI QIDQ876727
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
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies ⋮ Axiomatic characterization of the toll walk function of some graph classes ⋮ Approximation and fixed-parameter algorithms for consecutive ones submatrix problems ⋮ Quasimonotone graphs ⋮ Graph classes and the switch Markov chain for matchings ⋮ On efficient domination for some classes of \(H\)-free bipartite graphs ⋮ Independent packings in structured graphs ⋮ Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid 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
This page was built for publication: Recognizing graphs without asteroidal triples
