Independent sets which meet all longest paths

DOI10.1016/0012-365X(94)00261-GzbMath0856.05045OpenAlexW2117884707MaRDI QIDQ1917489

Hugo Alberto Rincón-Mejía, Hortensia Galeana-Sánchez

Publication date: 7 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00261-g

zbMATH Keywords

independent setproperty \(P\)longest directed path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Computational results on the traceability of oriented graphs of small order ⋮ Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs ⋮ Independent sets and non-augmentable paths in generalizations of tournaments ⋮ Traceability of \(k\)-traceable oriented graphs

Cites Work

• On kernels and semikernels of digraphs
• On kernel-perfect critical digraphs
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
• Nombre chromatique et plus longs chemins d'un graphe
• Maximal chains and antichains
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Independent sets which meet all longest paths