Zobrazeno 1 - 10
of 177
pro vyhledávání: '"Gould Ronald J."'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 1, Pp 157-170 (2019)
A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from the complement of G to G results in a copy of H. The minimum number of edges (the size) of an H-saturated graph on n vertices is denoted sat(n,H), while the maximu
Externí odkaz:
https://doaj.org/article/28a12a935ee54bc2b558aec7ec4e2094
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 3, Pp 811-822 (2017)
A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from G̅ to G results in a copy of H. The minimum size of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum size is the well studied extremal nu
Externí odkaz:
https://doaj.org/article/a54c4c29733b4989bb0a016fe2e69b4f
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 4, Pp 677-693 (2013)
For a fixed graph F, a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G, there is a copy of F in G + e. The minimum number of edges in an F-saturated graph of order n will be denoted by sat(n, F). A graph G is weakly F-s
Externí odkaz:
https://doaj.org/article/05f0ce25cbae4072a13151ffafb8eafd
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 1, Pp 9-23 (2013)
We say that a graph G is maximal Kp-free if G does not contain Kp but if we add any new edge e ∈ E(G) to G, then the graph G + e contains Kp. We study the minimum and maximum size of non-(p − 1)-partite maximal Kp-free graphs with n vertices. We
Externí odkaz:
https://doaj.org/article/ec98fbd08e0a4b5ba8dbaf311ac0e16e
Autor:
CREAM, MEGAN1 macd19@lehigh.edu, GOULD, RONALD J.2 rg@mathcs.emory.edu
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2024, Vol. 44 Issue 1, p337-350. 14p.
Publikováno v:
In Journal of Combinatorial Theory, Series B September 2022 156:194-222
Publikováno v:
Discrete Mathematics, Volume 340, Issue 12, December 2017, Pages 2878-2888
We call a graph $G$ pancyclic if it contains at least one cycle of every possible length $m$, for $3\le m\le |V(G)|$. In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient t
Externí odkaz:
http://arxiv.org/abs/1709.06898
Publikováno v:
Journal of Graph Theory; Jun2024, Vol. 106 Issue 2, p213-224, 12p
Autor:
Gould, Ronald J.1 (AUTHOR) rg@emory.edu
Publikováno v:
Graphs & Combinatorics. Dec2022, Vol. 38 Issue 6, p1-27. 27p.