Pages that link to "Item:Q4268709"
From MaRDI portal
The following pages link to Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs (Q4268709):
Displaying 38 items.
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- On end-vertices of lexicographic breadth first searches (Q968161) (← links)
- Boxicity and cubicity of asteroidal triple free graphs (Q968429) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- Hereditary dominating pair graphs (Q1421473) (← links)
- On claw-free asteroidal triple-free graphs (Q1613398) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- On the domination search number (Q1811076) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- On the minimum eccentricity isometric cycle problem (Q2132344) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- Robinsonian matrices: recognition challenges (Q2403299) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- On the power of graph searching for cocomparability graphs (Q2801333) (← links)
- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes (Q2827811) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
- Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem (Q2958315) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- On the power of BFS to determine a graph's diameter (Q4446912) (← links)
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186) (← links)
- Approximating the Bandwidth for Asteroidal Triple-Free Graphs (Q4719340) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- (Q5071562) (← links)
- Asteroidal triples of moplexes (Q5939228) (← links)
- Diameter determination on restricted graph families (Q5951960) (← links)
- The diameter of AT‐free graphs (Q6057658) (← links)
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications (Q6493757) (← links)
- Gallai-like characterization of strong cocomparability graphs (Q6595514) (← links)
