A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
- 1 March 1967
- journal article
- Published by Springer Nature in Acta Mathematica Hungarica
- Vol. 18 (1-2) , 191-206
- https://doi.org/10.1007/bf02020974
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On the maximal number of disjoint circuits of a graphPublicationes Mathematicae Debrecen, 2022
- On Independent Circuits Contained in a GraphCanadian Journal of Mathematics, 1965
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von GraphenActa Mathematica Hungarica, 1964