Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Borowiecki Piotr"'
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
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.
The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph $G$. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input intege
Externí odkaz:
http://arxiv.org/abs/2101.06645
Publikováno v:
In Theoretical Computer Science 20 February 2023 947
The independence number $\alpha(H)$ of a hypergraph $H$ is the maximum cardinality of a set of vertices of $H$ that does not contain an edge of $H$. Generalizing Shearer's classical lower bound on the independence number of triangle-free graphs (J. C
Externí odkaz:
http://arxiv.org/abs/1507.04323
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
A complete $k$-coloring of a graph $G=(V,E)$ is an assignment $\varphi:V\to\{1,\ldots,k\}$ of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three ex
Externí odkaz:
http://arxiv.org/abs/1312.7522
Autor:
Borowiecki, Piotr, Rautenbach, Dieter
Publikováno v:
In Discrete Applied Mathematics 19 February 2015 182:61-72
Publikováno v:
In Theoretical Computer Science 6 November 2014 557:76-86
Autor:
Borowiecki, Piotr1 pborowie@eti.pg.gda.pl, Sidorowicz, Elżbieta2 e.sidorowicz@wmie.uz.zgora.pl
Publikováno v:
Graphs & Combinatorics. May2018, Vol. 34 Issue 3, p457-475. 19p.