Search
Now showing items 1-1 of 1
Edge maximal non-bipartite Hamiltonian graphs without theta graphs of order 7
(
Forum-Editrice Universitaria Udinese SRL
, 2019 , Article)
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 ? H(n; F)} where E(G) is the number of edges ...