Girth in graphs
- 1 October 1983
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 35 (2) , 129-141
- https://doi.org/10.1016/0095-8956(83)90067-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Graph decomposition with applications to subdivisions and path systems modulo kJournal of Graph Theory, 1983
- Circuits through specified edgesDiscrete Mathematics, 1982
- Graphs having circuits with at least two chordsJournal of Combinatorial Theory, Series B, 1982
- Circuits containing specified edgesJournal of Combinatorial Theory, Series B, 1977
- Cycles Modulo kBulletin of the London Mathematical Society, 1977
- Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend großer KantendichteAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1972
- Existenz gewisser Konfigurationen inn-gesättigten Graphen und in Graphen genügend großer KantendichteMathematische Annalen, 1971
- On the maximal number of independent circuits in a graphActa Mathematica Hungarica, 1963