Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Linda Lesniak"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 2, Pp 665-669 (2020)
In 1972 Chvátal gave a well-known sufficient condition for a graphical sequence to be forcibly Hamiltonian, and showed that in some sense his condition is best possible. In this paper, we conjecture that with probability 1 as Chvátal’s sufficient
Externí odkaz:
https://doaj.org/article/8fc4411c8db24ce4b22ded91e69886dc
Autor:
Rachel Kirsch, Kirsten Hogenson, Jill R. Faudree, Linda Lesniak, Gabriela Araujo-Pardo, Zhanar Berikkyzy, Jessica McDonald
Publikováno v:
Association for Women in Mathematics Series ISBN: 9783030779825
We consider the problem of finding long cycles in balanced tripartite graphs. We survey the relevant literature, namely degree and edge conditions for Hamiltonicity and long cycles in graphs, including bipartite and k-partite results where they exist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e07fe213dba2efd52a9ddba525daad3c
https://doi.org/10.1007/978-3-030-77983-2_1
https://doi.org/10.1007/978-3-030-77983-2_1
Autor:
Andrzej Dudek, Linda Lesniak
Publikováno v:
Discrete Mathematics. 339:1753-1762
In this paper, we study an analogue of size-Ramsey numbers for vertex colorings. For a given number of colors? r and a graph? G the vertex size-Ramsey number of G , denoted by R ? v ( G , r ) , is the least number of edges in a graph H with the prope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19af9dfc8337bf22b719abc9347bc872
https://doi.org/10.1016/j.disc.2016.02.001
https://doi.org/10.1016/j.disc.2016.02.001
Publikováno v:
Discussiones Mathematicae Graph Theory. 43:225
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::727ea172b2e39d087149a6b502bd1e64
https://doi.org/10.7151/dmgt.2360
https://doi.org/10.7151/dmgt.2360
Autor:
Daniela Ferrero, Linda Lesniak
We prove that for any integers $p\geq k\geq 3$ and any $k$-tuple of positive integers $(n_1,\ldots ,n_k)$ such that $p=\sum _{i=1}^k{n_i}$ and $n_1\geq n_2\geq \ldots \geq n_k$, the condition $n_1\leq {p\over 2}$ is necessary and sufficient for every
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db3df05655e18632fbb25d3e3574c99a
Autor:
Linda Lesniak, Arthur T. White
Publikováno v:
Missouri J. Math. Sci. 29, iss. 2 (2017), 219-222
We show, with simple combinatorics, that if the dimples on a golf ball are all 5-sided and 6-sided polygons, with three dimples at each “vertex”, then no matter how many dimples there are and no matter the sizes and distribution of the dimples, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04cf3ad6b9f5b96a79963475124506c0
https://doi.org/10.35834/mjms/1513306833
https://doi.org/10.35834/mjms/1513306833
Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory.Fully updated and th
Autor:
Linda Lesniak
Publikováno v:
Graph Theory ISBN: 9783319319384
In 1973, Chvatal introduced the concept of “tough graphs” and conjectured that graphs with sufficiently high toughness are hamiltonian. Here we look at some personal perspectives of this conjecture, both those of Chvatal and the author. Furthermo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8eca2995a19d8c55200db62e9ed25316
https://doi.org/10.1007/978-3-319-31940-7_9
https://doi.org/10.1007/978-3-319-31940-7_9
Publikováno v:
Information Sciences. 179:1092-1101
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks , the optimal sets are precisely those induc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e958abcf251b410328f30c655ab8b8a6
https://doi.org/10.1016/j.ins.2008.10.029
https://doi.org/10.1016/j.ins.2008.10.029
Publikováno v:
International Journal of Foundations of Computer Science. 19:1413-1437
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number for the alternating group graphs, Cayley gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e75af1565bc70107f9b647a2c77ea5b
https://doi.org/10.1142/s0129054108006364
https://doi.org/10.1142/s0129054108006364