BE-diperfect digraphs with stability number two
From MaRDI portal
Recommendations
Cites work
- \(\alpha\)-diperfect digraphs
- A family of counterexamples for a conjecture of Berge on \(\alpha\)-diperfect digraphs
- Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
- Covering digraphs by paths
- Diperfect graphs
- Ein kombinatorischer Satz.
- Every finite strongly connected digraph of stability 2 has a Hamiltonian path
- Graph theory
- scientific article; zbMATH DE number 3165195 (Why is no real title available?)
- Path Partitions in Directed Graphs
- Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
- Some results on Berge's conjecture and begin-end conjecture
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
- Sur les arborescences dans un graphe oriente
- The strong perfect graph theorem
This page was built for publication: BE-diperfect digraphs with stability number two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574382)