Recognizing the -structure of claw-free graphs and a larger graph class.
Babel, Luitpold; Brandstädt, Andreas; Le, Van Bang
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2002)
- Volume: 5, Issue: 1, page 127-146
- ISSN: 1365-8050
Access Full Article
topHow to cite
topBabel, Luitpold, Brandstädt, Andreas, and Le, Van Bang. "Recognizing the -structure of claw-free graphs and a larger graph class.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 5.1 (2002): 127-146. <http://eudml.org/doc/122067>.
@article{Babel2002,
author = {Babel, Luitpold, Brandstädt, Andreas, Le, Van Bang},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {claw-free graphs; reconstruction problem; -structure; -connected graphs; homogeneous set; perfect graphs; -structure; -connected graphs},
language = {eng},
number = {1},
pages = {127-146},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Recognizing the -structure of claw-free graphs and a larger graph class.},
url = {http://eudml.org/doc/122067},
volume = {5},
year = {2002},
}
TY - JOUR
AU - Babel, Luitpold
AU - Brandstädt, Andreas
AU - Le, Van Bang
TI - Recognizing the -structure of claw-free graphs and a larger graph class.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2002
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 5
IS - 1
SP - 127
EP - 146
LA - eng
KW - claw-free graphs; reconstruction problem; -structure; -connected graphs; homogeneous set; perfect graphs; -structure; -connected graphs
UR - http://eudml.org/doc/122067
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.