Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Michael Tarsi"'
Autor:
Miri Priesler, Michael Tarsi
Publikováno v:
Journal of Systemics, Cybernetics and Informatics, Vol 7, Iss 3, Pp 25-32 (2009)
Due to some intractability considerations, reasonable formulation of necessary and sufficient conditions for decomposability of a general multigraph G into a fixed connected multigraph H, is probably not feasible if the underlying simple graph of H h
Externí odkaz:
https://doaj.org/article/a657ab106d084ca08ba3873bac86f45e
Autor:
Miri Priesler, Michael Tarsi
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
Due to some intractability considerations, reasonable formulation of necessary and sufficient conditions for decomposability of a general multigraph G into a fixed connected multigraph H, is probably not feasible if the underlying simple graph of H h
Externí odkaz:
https://doaj.org/article/63b9c925efa24dec8485c8754e1c94fd
Autor:
Michael Tarsi
Publikováno v:
Journal of Graph Theory. 95:138-159
An (r,alpha)-bounded excess flow ((r,alpha)-flow) in an orientation of a graph G=(V,E) is an assignment of a real "flow value" between 1 and r-1 to every edge. Rather than 0 as in an actual flow, some flow excess, which does not exceed alpha may accu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9bb34b62159640ebb4fa98e1602874cd
https://doi.org/10.1002/jgt.22543
https://doi.org/10.1002/jgt.22543
Publikováno v:
Journal of Graph Theory. 86:149-158
A $k$-weak bisection of a cubic graph $G$ is a partition of the vertex-set of $G$ into two parts $V_1$ and $V_2$ of equal size, such that each connected component of the subgraph of $G$ induced by $V_i$ ($i=1,2$) is a tree of at most $k-2$ vertices.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::599f55ec68d9320323d1918233e6c072
https://doi.org/10.1002/jgt.22118
https://doi.org/10.1002/jgt.22118
Publikováno v:
Journal of Graph Theory. 68:340-348
A shortest cycle cover of a graph G is a family of cycles which together cover all the edges of G and the sum of their lengths is minimum. In this article we present upper bounds to the length of shortest cycle covers, associated with the existence o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5453c675ef7e5e0c4fa31b2860d93541
https://doi.org/10.1002/jgt.20563
https://doi.org/10.1002/jgt.20563
Autor:
Shai Gutner, Michael Tarsi
Publikováno v:
Discrete Mathematics. 309:2260-2270
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a:b)-choosable, and c/d>a/b, then G is not necessarily (c:d)-choosable. Applying probabilistic methods, an upper bound for the kth choice number of a grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7fe1332ca770af5fc9d9785bf55dc32
https://doi.org/10.1016/j.disc.2008.04.061
https://doi.org/10.1016/j.disc.2008.04.061
Autor:
Michael Tarsi, David Tankus
Publikováno v:
Discrete Mathematics. 309:2180-2189
Let G=(V,E) be a graph and let f be a function f:V->N. A partial f-factor of G is a subgraph H of G, such that the degree in H of every vertex [email protected]?V is at most f(v). We study here the recognition problem of graphs, where all maximal par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31b72418bee3c64ca9e03df1f1598129
https://doi.org/10.1016/j.disc.2008.04.047
https://doi.org/10.1016/j.disc.2008.04.047
Publikováno v:
Journal of Combinatorics
Journal of Combinatorics, International Press, 2016, 7 (2), pp.453-479. ⟨10.4310/JOC.2016.v7.n2.a12⟩
Journal of Combinatorics, International Press, 2016, 7 (2), pp.453-479. ⟨10.4310/JOC.2016.v7.n2.a12⟩
For some time the Petersen graph has been the only known Snark with circular flow number $5$ (or more, as long as the assertion of Tutte's $5$-flow Conjecture is in doubt). Although infinitely many such snarks were presented eight years ago by Macajo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc0b9b7f3d72bd5c877a28269b9a0b2e
https://hal.archives-ouvertes.fr/hal-01119817
https://hal.archives-ouvertes.fr/hal-01119817
Autor:
Michael Tarsi, David Tankus
Publikováno v:
Discrete Mathematics. 307:1833-1843
There are various greedy schemas to construct a maximal path in a given input graph. Associated with each such schema is the family of graphs where it always results a path of maximum length, or a Hamiltonian path/cycle, if there exists one. Consider
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4790d6dd281e2ce773162c93af744030
https://doi.org/10.1016/j.disc.2006.09.031
https://doi.org/10.1016/j.disc.2006.09.031
Autor:
Miri Priesler, Michael Tarsi
Publikováno v:
Discrete Mathematics. 296:235-244
We study the decomposition of multigraphs with a constant edge multiplicity into copies of a fixed star H=K1,t: We present necessary and sufficient conditions for such a decomposition to exist where t=2 and prove NP-completeness of the corresponding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a7980062667cfe4bd66af6d0b7723e13
https://doi.org/10.1016/j.disc.2005.03.012
https://doi.org/10.1016/j.disc.2005.03.012