Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ranko Šcepanovic"'
Publikováno v:
Journal of Graph Theory. 18:777-789
G. Ringel conjectured that for every positive integer n other than 2, 4, 5, 8, 9, and 16, there exists a nonseparable graph with n cycles. It is proved here that the conjecture is true even with the restriction to planar and hamiltonian graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c93f9f15be23ac795ee42f33539ce6b5
https://doi.org/10.1002/jgt.3190180803
https://doi.org/10.1002/jgt.3190180803
