Independent sets and non-augmentable paths in generalizations of tournaments

@article{GaleanaSnchez2008IndependentSA,
  title={Independent sets and non-augmentable paths in generalizations of tournaments},
  author={Hortensia Galeana-S{\'a}nchez and Ricardo G{\'o}mez},
  journal={Discrete Mathematics},
  year={2008},
  volume={308},
  pages={2460-2472}
}
We study different classes of digraphs, which are generalizations of tournaments, to have the property of possessing a maximal independent set intersecting every non-augmentable or every longest path. The classes are the arc-local tournament, quasi-transitive, path-mergeable, locally insemicomplete (out-semicomplete), and semicomplete k-partite digraphs. A short survey is included in the introduction. 

From This Paper

Topics from this paper.
9 Citations
19 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Digraphs: Theory

  • J. Bang-Jensen, G. Gutin
  • Algorithms and Applications.
  • 2001
1 Excerpt

Rincón-Mej́ıa. Independent sets which meet all longest paths

  • H.A.H. Galeana-Sánchez
  • Discrete Math
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…