Abstract
Gallai and Milgram (1960) proved that a digraph with stability number α is spanned by α disjoint directed paths. Chen and Manalastas Jr (1983) proved that a strong digraph with stability number at most two is spanned by at most two consistent directed circuits. We slightly simplify the proof of the Gallai-Milgram theorem, while at the same time refining its statement, and use this sharpened version to obtain a relatively short proof of the Chen-Manalastas theorem. We also give a counterexample to a generalization of the Gallai-Milgram theorem conjectured by Hartman (1988).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
