Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Robert E. L. Aldred"'
Publikováno v:
Graphs and Combinatorics. 37:1793-1806
A graph G is said to be distance d matchable if, for any matching M of G in which edges are pairwise at least distance d apart, there exists a perfect matching $$M^*$$ of G which contains M. In this paper, we prove the following results: (i) if G is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26f0f50ec96571eeac284e87ba0db177
https://doi.org/10.1007/s00373-021-02295-9
https://doi.org/10.1007/s00373-021-02295-9
Publikováno v:
Discrete Applied Mathematics. 284:251-261
We present a complete description of matching extendability in 5-connected planar triangulations after the deletion of a set of vertices of appropriate parity. We also introduce a variation of distance restricted matching extension in the setting of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0b4ef9aa356d3b5ef712ea2a7b4fa55
https://doi.org/10.1016/j.dam.2020.03.037
https://doi.org/10.1016/j.dam.2020.03.037
Publikováno v:
Journal of Graph Theory. 95:240-255
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00219c22492e25fe0e9ae5ddc8a5b634
https://doi.org/10.1002/jgt.22560
https://doi.org/10.1002/jgt.22560
Publikováno v:
Graphs and Combinatorics. 36:573-589
A connected graph G has property E(m, n) (or more briefly “G is E(m, n)”) if for every pair of disjoint matchings M and N in G with $$|M|=m$$ and $$|N|=n$$ respectively, there is a perfect matching F in G such that $$M\subseteq F$$ and $$N\cap F=
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65158e3738f50f3ef396c686833df374
https://doi.org/10.1007/s00373-020-02139-y
https://doi.org/10.1007/s00373-020-02139-y
Publikováno v:
Alahmadi, A, Aldred, R E L & Thomassen, C 2020, ' Cycles in 5-connected triangulations ', Journal of Combinatorial Theory. Series B, vol. 140, pp. 27-44 . https://doi.org/10.1016/j.jctb.2019.04.005
We show that in 5-connected planar and projective planar triangulations on n vertices, the number of Hamiltonian cycles grows exponentially with n. The result is best possible in the sense that 4-connected triangulations on n vertices on any fixed su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a5f47334d162101ad30fd14f7557cd0
https://doi.org/10.1016/j.jctb.2019.04.005
https://doi.org/10.1016/j.jctb.2019.04.005
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 1, Iss Graph Theory (2015)
Graph Theory
Externí odkaz:
https://doaj.org/article/aff3f38c797c4330b49bc48bf79033d2
Publikováno v:
Journal of Graph Theory. 93:5-20
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16b49a00950cb47128e2e0a804394531
https://doi.org/10.1002/jgt.22465
https://doi.org/10.1002/jgt.22465
Publikováno v:
Journal of Graph Theory. 90:61-82
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69c3cea7591b5f15503afff309f16616
https://doi.org/10.1002/jgt.22368
https://doi.org/10.1002/jgt.22368
Publikováno v:
Discrete Mathematics. 340:2978-2985
A matching M in a graph G is said to be extendable if there exists a perfect matching of G containing M . In 1989, it was shown that every connected planar graph with at least 8 vertices has a matching of size three which is not extendable. In contra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02c6cd4b206eb15e0e179972b9ad72fc
https://doi.org/10.1016/j.disc.2017.07.017
https://doi.org/10.1016/j.disc.2017.07.017
Publikováno v:
Discrete Applied Mathematics. 221:25-32
If G is any graph, the prism graph of G, denoted P(G), is the cartesian product of G with a single edge, or equivalently, the graph obtained by taking two copies of G, say G1 and G2, with the same vertex labelings and joining each vertex of G1 to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d852cd74939e6aa9ec0b7b509e3c0df
https://doi.org/10.1016/j.dam.2016.12.017
https://doi.org/10.1016/j.dam.2016.12.017