Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Siemion Fajtlowicz"'
This volume presents topics addressed at the working group meeting and workshop on Computer-generated Conjectures from Graph Theoretic and Chemical Databases held at Rutgers University (Piscataway, NJ). The events brought together theoreticians and p
Autor:
Siemion Fajtlowicz
Publikováno v:
Journal of Applied & Computational Mathematics.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bdd8c4c3bbd0770ce14718eabe27664
https://doi.org/10.4172/2168-9679.1000e132
https://doi.org/10.4172/2168-9679.1000e132
Publikováno v:
Discrete Mathematics. 92(1-3):85-88
The computer program Graffiti has conjectured that the chromatic number of a triangle-free graph does not exceed the maximum number of occurrences of an element of the degree sequence. We prove that indeed if no degree occurs more than twice, the gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ddf00e71df417aa3760bcf3174ebb16
Publikováno v:
DIMACS Series in Discrete Mathematics and Theoretical Computer Science ISBN: 9780821843802
Graphs and Discovery
Graphs and Discovery
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dde4a43373e4e6723485804c1416d589
https://doi.org/10.1090/dimacs/069
https://doi.org/10.1090/dimacs/069
Publikováno v:
Croatica Chemica Acta
Volume 78
Issue 2
Volume 78
Issue 2
In August 2003 the computer program GRAFFITI made conjecture 1001 stating that for any benzenoid graph, the size of a maximum matching equals the number of positive eigenvalues. Later, the authors learned that this conjecture was already known in 198
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______951::e616503383401dc0bf6ff003de7ec273
https://hrcak.srce.hr/file/12
https://hrcak.srce.hr/file/12
Publikováno v:
Algebraic Combinatorics and Applications ISBN: 9783540411109
The definition of a fullerene as a cubic polyhedron made up entirely of pentagons and hexagons is compatible with a huge variety of isomeric forms for structures of chemically achievable size (n ~ 100 or fewer vertices ≡ carbon atoms). Generation o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f2c6dd07031eb2608dc98b0808a1ce5
https://doi.org/10.1007/978-3-642-59448-9_10
https://doi.org/10.1007/978-3-642-59448-9_10
Autor:
Ermelinda DeLaViña, Siemion Fajtlowicz
Publikováno v:
The Electronic Journal of Combinatorics. 3
Every graph of chromatic number $k$ with more than $k(r-1)(b-1)$ vertices has a $b$-element independent set of vertices such that if any two of them are joined by an edge then the chromatic number stays the same or a $r$-element independent set of ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55566ed4d6b1f252ec34f564fd92f934
https://doi.org/10.37236/1250
https://doi.org/10.37236/1250
Publikováno v:
Fundamenta Mathematicae. 103:189-203
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef8abde283a54a2af544f859610ea577
https://doi.org/10.4064/fm-103-3-189-203
https://doi.org/10.4064/fm-103-3-189-203