Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Mohammad M. M. Jaradat"'
Publikováno v:
Boletim da Sociedade Paranaense de Matemática, Vol 39, Iss 4 (2020)
For a set of graphs F , let H(n; F ) denote the class of non-bipartite Hamiltonian graphs on n vertices that does not contain any graph of F as a subgraph and h(n; F ) = max{E (G) : G E H(n; F )} where E (G) is the number of edges in G. In this paper
Externí odkaz:
https://doaj.org/article/9aed33be1ab249f1b8ecb7fdea80564a
Publikováno v:
Boletim da Sociedade Paranaense de Matemática. 39:21-34
For a set of graphs F , let H(n; F ) denote the class of non-bipartite Hamiltonian graphs on n vertices that does not contain any graph of F as a subgraph and h(n; F ) = max{E (G) : G E H(n; F )} where E (G) is the number of edges in G. In this paper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25b6421893cd1d8162c22719d82ec414
https://doi.org/10.5269/bspm.41921
https://doi.org/10.5269/bspm.41921