Zobrazeno 1 - 10
of 530
pro vyhledávání: '"Trémaux tree"'
Publikováno v:
European Journal of Combinatorics. 66:191-234
One of the most famous algorithmic meta-theorems states that every graph property which can be defined in counting monadic second order logic (CMSOL) can be checked in linear time on graphs of bounded treewidth, which is known as Courcelle’s Theore
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::055315ab5b407cdf8303fa2ad5510019
https://doi.org/10.1016/j.ejc.2017.06.025
https://doi.org/10.1016/j.ejc.2017.06.025
Publikováno v:
Journal of Parallel and Distributed Computing. 109:1-14
A cut tree is a combinatorial structure that represents the edge-connectivity between all pairs of vertices of an undirected graph. Cut trees solve the all pairs minimum s – t -cut problem efficiently. Cut trees have a large number of applications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17723f76dfdf8f9a8fd763e1c3fc828d
https://doi.org/10.1016/j.jpdc.2017.04.007
https://doi.org/10.1016/j.jpdc.2017.04.007
Publikováno v:
European Journal of Combinatorics. 65:259-275
A closed curve in the Freudenthal compactification | G | of an infinite locally finite graph G is called a Hamiltonian curve if it meets every vertex of G exactly once (and hence it meets every end at least once). We prove that | G | has a Hamiltonia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eaab16039c5687c8a74c68bb4eabca88
https://doi.org/10.1016/j.ejc.2017.06.006
https://doi.org/10.1016/j.ejc.2017.06.006
Autor:
S.N. Daoud
Publikováno v:
Journal of the Egyptian Mathematical Society, Vol 25, Iss 4, Pp 424-433 (2017)
The literature is very rich with works deal with the enumerating the spanning trees in any graph G since the pioneer Kirchhoff (1847). Generally, the number of spanning trees in a graph can be acquired by directly calculating an associated determinan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9b22a0638fa369310aa880da11399e0
https://doi.org/10.1016/j.joems.2017.07.005
https://doi.org/10.1016/j.joems.2017.07.005
Autor:
Helin Gong, Shuli Li
Publikováno v:
Discrete Applied Mathematics. 229:154-160
Based on electrically equivalent transformations on weighted graphs, in this paper, we present a formula for computing the number of spanning trees of a family of 2-separable graphs formed from two base graphs by 2-sum operations. As applications, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9959e7af9cc466a11b1866f589ea9480
https://doi.org/10.1016/j.dam.2017.05.003
https://doi.org/10.1016/j.dam.2017.05.003
Autor:
R. Tusserkani, M. Ariannejad
Publikováno v:
Linear and Multilinear Algebra. 66:1757-1766
The spanning tree packing number of a graph G, denoted by STP(G), is the maximum number of edge-disjoint spanning trees contained in G. Let denotes the set of all spanning trees of G. We sa...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6afbf465d2d0ffab5d9aba7da741e1a
https://doi.org/10.1080/03081087.2017.1370687
https://doi.org/10.1080/03081087.2017.1370687
Autor:
Weigen Yan
Publikováno v:
Applied Mathematics and Computation. 307:239-243
Let G be a simple graph with n vertices and m edges, and and the maximum degree and minimum degree of G. Suppose G is the graph obtained from G by attaching dG(v) pendent edges to each vertex v of G. Huang and Li (Bull. Aust. Math. Soc. 91(2015), 353
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea22ef771901cfba7f662527cf51bbc1
https://doi.org/10.1016/j.amc.2017.02.040
https://doi.org/10.1016/j.amc.2017.02.040
Publikováno v:
Computational Optimization and Applications. 68:749-773
Decomposition methods for optimal spanning trees on graphs are explored in this work. The attention is focused on optimization problems where the objective function depends only on the degrees of the nodes of the tree. In particular, we deal with the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0727fc776ea7af1e6b2e88b42fad6731
https://doi.org/10.1007/s10589-017-9924-7
https://doi.org/10.1007/s10589-017-9924-7
Autor:
Reinhard Diestel, Julian Pott
Publikováno v:
Journal of Combinatorial Theory, Series B. 123:32-53
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an infinite settin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59617400dd57ca03b33bcdd1a98bd19e
https://doi.org/10.1016/j.jctb.2016.11.005
https://doi.org/10.1016/j.jctb.2016.11.005
Autor:
Masao Tsugaki, Zheng Yan
Publikováno v:
Advances and Applications in Discrete Mathematics. 17:453-459
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1858f5420ffb5dc4de907ea437cf926c
https://doi.org/10.17654/dm017040453
https://doi.org/10.17654/dm017040453