论文信息 - INDEPENDENT TRANSVERSALS OF LONGEST PATHS IN LOCALLY SEMICOMPLETE AND LOCALLY TRANSITIVE DIGRAPHS

INDEPENDENT TRANSVERSALS OF LONGEST PATHS IN LOCALLY SEMICOMPLETE AND LOCALLY TRANSITIVE DIGRAPHS

We present several results concerning the Laborde-Payan-Xuang conjecture stating that in every digraph there exists an independent set of vertices intersecting every longest path. The digraphs we consider are defined in terms of local semicompleteness and local transitivity. We also look at oriented graphs for which the length of a longest path does not exceed 4.

Juan José Montellano-Ballesteros | Hortensia Galeana-Sánchez | Ricardo Gómez | H. Galeana-Sánchez | R. Gómez

[1] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .

[2] S. E. Markosyan,et al. ω-Perfect graphs , 1990 .

[3] L. Lovász,et al. Every directed graph has a semi-kernel , 1974 .

[4] Ortrud R. Oellermann,et al. A Traceability Conjecture for Oriented Graphs , 2008, Electron. J. Comb..

[5] Ortrud R. Oellermann,et al. The directed path partition conjecture , 2005, Discuss. Math. Graph Theory.

[6] Gregory Gutin,et al. Generalizations of tournaments: A survey , 1998, J. Graph Theory.

[7] Hortensia Galeana-Sánchez,et al. Independent sets and non-augmentable paths in generalizations of tournaments , 2008, Discret. Math..

[8] Vladimir Gurvich,et al. Perfect graphs, kernels, and cores of cooperative games , 2006, Discret. Math..

[9] Jørgen Bang-Jensen,et al. Locally semicomplete digraphs: A generalization of tournaments , 1990, J. Graph Theory.

[10] Jørgen Bang-Jensen,et al. Longest path partitions in generalizations of tournaments , 2006, Discret. Math..