Asteroidal triple-free graphs-Reference-Cited by-同舟云学术

Asteroidal triple-free graphs

Published:1994 Issue: Volume: Page:211-224
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Corneil Derek. G.,Olariu Stephan,Stewart Lorna

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57899-4_54.pdf

Reference14 articles.

1. S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Mathematics 23 (1989), 11–24.

2. F. Cheah, private communication.

3. D.G. Corneil and P. A. Kamula, Extensions of permutation and interval graphs, Proceedings 18th Southeastern Conference on Combinatorics, Graph Theory and Computing (1987), 267–276.

4. D.G. Corneil, H. Lerchs, L. Stewart Burlingham, Complement reducible graphs, Discrete. Applied Mathematics 3 (1981), 163–174.

5. D. G. Corneil, S. Olariu, and L. Stewart, Asteroidal triple-free graphs, Department of Computer Science, University of Toronto, Technical Report 262/92, June 1992.

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

1. Asteroidal Sets and Dominating Paths;Combinatorial Optimization and Applications;2023-12-09

2. Axiomatic Characterization of the Toll Walk Function of Some Graph Classes;Algorithms and Discrete Applied Mathematics;2023

3. Complexity Classification of Some Edge Modification Problems;Graph-Theoretic Concepts in Computer Science;1999

4. Pseudo-hamiltonian graphs;Graph-Theoretic Concepts in Computer Science;1997

5. Independent sets in asteroidal triple-free graphs;Automata, Languages and Programming;1997