On the maximal number of independent circuits in a graph
From MaRDI portal
Publication:5734435
DOI10.1007/BF01901931zbMath0122.24903OpenAlexW2094126876WikidataQ105699243 ScholiaQ105699243MaRDI QIDQ5734435
Publication date: 1963
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01901931
Related Items
On the Corrádi-Hajnal theorem and a question of Dirac, Disjoint cycles in digraphs, Rooted prism-minors and disjoint cycles containing a specified edge, The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, A Sharp Dirac–Erdős Type Bound for Large Graphs, Filtered matchings and simplicial complexes, On the maximal number of independent circuits in a graph, Unnamed Item, On the number of independent chorded cycles in a graph, On the minors of an incidence matrix and Smith normal form, The point-arboricity of a graph, Strengthening Theorems of Dirac and Erdős on Disjoint Cycles, Distance spectrum, 1-factor and vertex-disjoint cycles, Maximum cycle packing using SPR-trees
Cites Work
