On claw-free asteroidal triple-free graphs
From MaRDI portal
Publication:1613398
DOI10.1016/S0166-218X(01)00208-6zbMath1002.68109MaRDI QIDQ1613398
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (9)
The diameter of AT‐free graphs ⋮ 3-colouring AT-free graphs in polynomial time ⋮ On linear and circular structure of (claw, net)-free graphs ⋮ Induced matchings in asteroidal triple-free graphs ⋮ Approximating the path-distance-width for AT-free graphs and graphs in related classes ⋮ Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs ⋮ On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs ⋮ Classes of graphs with \(e\)-positive chromatic symmetric function ⋮ Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
Cites Work
- Finding and counting given length cycles
- On domination and independent domination numbers of a graph
- Matrix multiplication via arithmetic progressions
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Characterizations and algorithmic applications of chordal graph embeddings
- Finding a central vertex in an HHD-free graph
- Domination and total domination on asteroidal triple-free graphs
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- Edge Dominating Sets in Graphs
- The NP-Completeness of Edge-Coloring
- Algorithmic Aspects of Vertex Elimination on Graphs
- Graph Classes: A Survey
- Independent Sets in Asteroidal Triple-Free Graphs
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Asteroidal Triple-Free Graphs
- Approximating the bandwidth for asteroidal triple-free graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On claw-free asteroidal triple-free graphs
