On claw-free asteroidal triple-free graphs-Reference-Cited by-同舟云学术

On claw-free asteroidal triple-free graphs

Published:2002-09 Issue:1-3 Volume:121 Page:155-180
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Hempel Harald,Kratsch Dieter

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference30 articles.

1. On domination and independent domination numbers of a graph;Allan;Discrete Math.,1978

2. Finding and counting given length cycles;Alon;Algorithmica,1997

3. A. Brandstädt, V. Bang Le, J. Spinrad, Graph Classes: a Survey, Society for Industrial and Applied Mathematics, Philadelphia, 1999.

4. A. Brandstädt, F.F. Dragan, E. Köhler, Linear time algorithms for hamiltonian problems on (claw,net)-free graphs, in: Proceedings of the 25th Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 1665, eds. P. Widmayer, G. Neyer, S. Eidenbenz, Springer, Berlin 1999, pp. 364–376.

5. Independent sets in asteroidal triple-free graphs;Broersma;SIAM J. Discrete Math.,1999

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The diameter of AT‐free graphs;Journal of Graph Theory;2021-10-08

2. On the $e$-Positivity of $(claw, 2K_2)$-Free Graphs;The Electronic Journal of Combinatorics;2021-06-18

3. Characterising AT-free Graphs with BFS;Graph-Theoretic Concepts in Computer Science;2018

4. The Convergence of Bird Flocking;Journal of the ACM;2014-07

5. Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition;Journal of the ACM;2014-07