Stable set meeting every longest path
From MaRDI portal
Recommendations
- Independent transversals of longest paths in locally semicomplete and locally transitive digraphs
- Paths and stability number in digraphs
- Girth, minimum degree and transversals of longest paths
- Independent sets which meet all longest paths
- Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
Cites work
- scientific article; zbMATH DE number 3150485 (Why is no real title available?)
- scientific article; zbMATH DE number 3838057 (Why is no real title available?)
- scientific article; zbMATH DE number 3013308 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- A short proof of the Chen-Manalastas theorem
- Every finite strongly connected digraph of stability 2 has a Hamiltonian path
- Nombre chromatique et plus longs chemins d'un graphe
Cited in
(12)- Computational results on the traceability of oriented graphs of small order
- Independent transversals of longest paths in locally semicomplete and locally transitive digraphs
- Girth, minimum degree and transversals of longest paths
- On a cycle partition problem
- Traceability of \(k\)-traceable oriented graphs
- Independent sets which meet all longest paths
- Independent sets and non-augmentable paths in generalizations of tournaments
- Longest path partitions in generalizations of tournaments
- A linear bound towards the traceability conjecture
- scientific article; zbMATH DE number 4004210 (Why is no real title available?)
- On \(k\)-anti-traceability of oriented graphs
- WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
This page was built for publication: Stable set meeting every longest path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763350)
