The following pages link to Asteroidal Triple-Free Graphs (Q4377431):
Displaying 50 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Some properties of edge intersection graphs of single-bend paths on a grid (Q658070) (← links)
- On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
- New characterizations of proper interval bigraphs (Q896097) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- Boxicity and cubicity of asteroidal triple free graphs (Q968429) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Radius versus diameter in cocomparability and intersection graphs (Q1356529) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Hereditary dominating pair graphs (Q1421473) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- On claw-free asteroidal triple-free graphs (Q1613398) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- Convex and isometric domination of (weak) dominating pair graphs (Q1749540) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- Interval \(k\)-graphs and orders (Q1789058) (← links)
- On the domination search number (Q1811076) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Injective hulls of various graph classes (Q2155861) (← links)
- Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
- A note on the geodetic number and the Steiner number of AT-free graphs (Q2220867) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs (Q2376078) (← links)
- Equivalence between pathbreadth and strong pathbreadth (Q2416435) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- On asteroidal sets in chordal graphs (Q2448883) (← links)
- Edge-dominating trails in AT-free graphs (extended abstract) (Q2741346) (← links)
- Some properties of edge intersection graphs of single bend paths on a grid (Q2851434) (← links)
- Rainbow connection number and connected dominating sets (Q2911064) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
