Zobrazeno 1 - 10
of 115
pro vyhledávání: '"Drgas-Burchardt Ewa"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 4, Pp 1163-1173 (2020)
In this paper we use the classical notion of weak Mycielskian M′(G) of a graph G and the following sequence: M′0(G) = G, M′1(G) = M′(G), and M′n(G) = M′(M′n−1(G)), to show that if G is a complete graph of order p, then the above seque
Externí odkaz:
https://doaj.org/article/78efee0b51f9412789b115d78becbcc3
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 893-917 (2020)
Given a hypergraph and a function f : V () → , we say that is f-choosable if there is a proper vertex colouring ϕ of such that ϕ (v) ∈ L(v) for all v ∈ V (), where L : V () → 2 is any assignment of f(v) co
Externí odkaz:
https://doaj.org/article/f59e5a0c03a3441484ed2fb32f110b67
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 2, Pp 323-349 (2018)
Let 𝒫 be an arbitrary class of graphs that is closed under taking induced subgraphs and let 𝒞 (𝒫) be the family of forbidden subgraphs for 𝒫. We investigate the class 𝒫 (k) consisting of all the graphs G for which the removal of no mor
Externí odkaz:
https://doaj.org/article/9b8d94ffc9354ed18ae7953a0eab2035
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 3, Pp 1-1 (2021)
Externí odkaz:
https://doaj.org/article/a030f2f818484bf1a13af0110b19b0a1
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 2, Pp 315-336 (2017)
A consecutive colouring of a graph is a proper edge colouring with posi- tive integers in which the colours of edges incident with each vertex form an interval of integers. The idea of this colouring was introduced in 1987 by Asratian and Kamalian un
Externí odkaz:
https://doaj.org/article/66c5386b18f74bc3b0f2d5751b79ed90
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 3, Pp 613-613 (2019)
Externí odkaz:
https://doaj.org/article/5a0367831b36463fa8339886da2667c7
Autor:
Drgas-Burchardt Ewa
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 1, Pp 49-55 (2013)
In this note we present some sufficient conditions for the uniqueness of a stable matching in the Gale-Shapley marriage classical model of even size. We also state the result on the existence of exactly two stable matchings in the marriage problem of
Externí odkaz:
https://doaj.org/article/e212b4444d1a44358d47497acdd6fdce
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 2, Pp 299-300 (2017)
Externí odkaz:
https://doaj.org/article/14ee4c8ac30041749bb7146faaaafec4
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 2, Pp 313-314 (2015)
Externí odkaz:
https://doaj.org/article/666530bb32144806b2f285cc0b3effa2
Autor:
BOROWIECKI, PIOTR1 p.borowiecki@issi.uz.zgora.pl, DRGAS-BURCHARDT, EWA2 e.drgas-burchardt@wmie.uz.zgora.pl, SIDOROWICZ, ELŻBIETA2 e.sidorowicz@wmie.uz.zgora.pl
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2024, Vol. 44 Issue 3, p1217-1241. 25p.