Recommendations
Cited in
(96)- Efficient algorithms for Roman domination on some classes of graphs
- Localized and compact data-structure for comparability graphs
- Treelike comparability graphs
- Radius versus diameter in cocomparability and intersection graphs
- Treewidth for graphs with small chordality
- On linear and circular structure of (claw, net)-free graphs
- Induced matchings in asteroidal triple-free graphs
- Hereditary dominating pair graphs
- On stable cutsets in graphs
- On claw-free asteroidal triple-free graphs
- Graph extremities defined by search algorithms
- Convex and isometric domination of (weak) dominating pair graphs
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- On the Steiner, geodetic and hull numbers of graphs
- Interval \(k\)-graphs and orders
- On the domination search number
- AT-free graphs: Linear bounds for the oriented diameter
- Triangulating graphs without asteroidal triples
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Domination and total domination on asteroidal triple-free graphs
- Injective hulls of various graph classes
- Complexity of paired domination in AT-free and planar graphs
- A note on the geodetic number and the Steiner number of AT-free graphs
- Pursuing a fast robber on a graph
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
- Equivalence between pathbreadth and strong pathbreadth
- Classes of perfect graphs
- Approximating the path-distance-width for AT-free graphs and graphs in related classes
- On asteroidal sets in chordal graphs
- Edge-dominating trails in AT-free graphs (extended abstract)
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Some properties of edge intersection graphs of single bend paths on a grid
- Rainbow connection number and connected dominating sets
- Vertex ranking of asteroidal triple-free graphs
- Vertex ordering characterizations of graphs of bounded asteroidal number
- Minimum eccentricity shortest path problem: an approximation algorithm and relation with the k-laminarity problem
- Approximability of the path-distance-width for AT-free graphs
- Characterizing directed path graphs by forbidden asteroids
- Asteroidal Triple of Edges in Bichordal Graphs: A Complete list
- Asteroidal Chromatic Number of a Graph
- Detecting induced minors in AT-free graphs
- Independent Sets in Asteroidal Triple-Free Graphs
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Independent sets in asteroidal triple-free graphs
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- Approximating the Bandwidth for Asteroidal Triple-Free Graphs
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- Connected domination and steiner set on asteroidal triple-free graphs
- scientific article; zbMATH DE number 7511525 (Why is no real title available?)
- Bipartite Analogues of Comparability and Cocomparability Graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Asteroidal-triple-free interval \(k\)-graphs
- Line-distortion, bandwidth and path-length of a graph
- Separator orders in interval, cocomparability, and AT-free graphs
- scientific article; zbMATH DE number 2191988 (Why is no real title available?)
- Linear Orderings of Subfamilies of AT‐Free Graphs
- Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges
- On rooted directed path graphs
- Graph classes and forbidden patterns on three vertices
- Tree-decompositions of small pathwidth
- Asteroidal triples of moplexes
- On the structure of graphs with bounded asteroidal number
- Complexity classification of some edge modification problems
- Diameter determination on restricted graph families
- Complexity of paired domination in at-free and planar graphs
- Asteroidal triple-free graphs
- Cops and robber on butterflies, grids, and AT-free graphs
- On characterizing proper max-point-tolerance graphs
- Path eccentricity of graphs
- Connected feedback vertex set on AT-free graphs
- Bandwidth on AT-free graphs
- Some properties of edge intersection graphs of single-bend paths on a grid
- Spanning caterpillar in biconvex bipartite graphs
- Gallai-like characterization of strong cocomparability graphs
- Graphs with at most two moplexes
- Connected feedback vertex set on AT-free graphs
- On the leaves of graph search trees
- Isometric path complexity of graphs
- Connected vertex cover on AT-free graphs
- Obstructions to faster diameter computation: asteroidal sets
- Path eccentricity of k-AT-free graphs and application on graphs with the consecutive ones property
- Odd chromatic number of graph classes
- Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
- On forbidden induced subgraphs for unit disk graphs
- Twin-width one
- Connectivity-preserving minimum separator in AT-free graphs
- Subset feedback vertex set and subset vertex cover on AT-free graphs
- Outer-planar vertex deletion on AT-free graphs
- Improved bounds on proper conflict-free coloring of graphs
- Minimal triangulations of graphs: a survey
- Minimal separators in \(P_4\)-sparse graphs
- Semitotal domination on AT-free graphs and circle graphs
- New characterizations of proper interval bigraphs
- Feedback vertex set on AT-free graphs
- Boxicity and cubicity of asteroidal triple free graphs
This page was built for publication: Asteroidal Triple-Free Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377431)
