On independent sets and non-augmentable paths in directed graphs
Discussiones Mathematicae. Graph Theory, Tome 18 (1998) no. 2, pp. 171-181
Voir la notice de l'article provenant de la source Library of Science
We investigate sufficient conditions, and in case that D be an asymmetrical digraph a necessary and sufficient condition for a digraph to have the following property: "In any induced subdigraph H of D, every maximal independent set meets every non-augmentable path". Also we obtain a necessary and sufficient condition for any orientation of a graph G results a digraph with the above property. The property studied in this paper is an instance of the property of a conjecture of J.M. Laborde, Ch. Payan and N.H. Huang: "Every digraph contains an independent set which meets every longest directed path" (1982).
Keywords:
digraph, independent set, directed path, non-augmentable path
@article{DMGT_1998_18_2_a3,
author = {Galeana-S\'anchez, H.},
title = {On independent sets and non-augmentable paths in directed graphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {171--181},
publisher = {mathdoc},
volume = {18},
number = {2},
year = {1998},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_1998_18_2_a3/}
}
Galeana-Sánchez, H. On independent sets and non-augmentable paths in directed graphs. Discussiones Mathematicae. Graph Theory, Tome 18 (1998) no. 2, pp. 171-181. http://geodesic.mathdoc.fr/item/DMGT_1998_18_2_a3/