Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Dybizbański, Janusz"'
Autor:
Dereniowski, Dariusz, Dybizbański, Janusz, Karpiński, Przemysław, Zakrzewski, Michał, Żyliński, Paweł
We present a simple linear-time algorithm that finds a spanning tree $T$ of a given $2$-edge-connected graph $G$ such that each vertex $v$ of $T$ has degree at most $\lceil \frac{\deg_G(v)}{2}\rceil + 1$.
Externí odkaz:
http://arxiv.org/abs/2410.20137
Autor:
Dybizbański, Janusz, Rowshan, Yaser
The $p$-partite Ramsey number for quadrilateral, denoted by $r_p(C_4,k)$, is the least positive integer $n$ such that any coloring of the edges of a complete $p$-partite graph with $n$ vertices in each partition with $k$ colors will result in a monoc
Externí odkaz:
http://arxiv.org/abs/2402.16816
Publikováno v:
In Discrete Applied Mathematics 15 September 2024 354:15-28
An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors needed to equ
Externí odkaz:
http://arxiv.org/abs/2002.10151
Autor:
Dybizbanski, Janusz
A signified graph is a pair $(G, \Sigma)$ where $G$ is a graph, and $\Sigma$ is a set of edges marked with '$-$'. Other edges are marked with '$+$'. A signified coloring of the signified graph $(G, \Sigma)$ is a homomorphism into a signified graph $(
Externí odkaz:
http://arxiv.org/abs/1909.00371
We consider hypercubes with pairwise disjoint faulty edges. An $n$-dimensional hypercube $Q_n$ is an undirected graph with $2^n$ nodes, each labeled with a distinct binary strings of length $n$. The parity of the vertex is 0 if the number of ones in
Externí odkaz:
http://arxiv.org/abs/1811.11516
A graph $G$ is equitably $k$-list arborable if for any $k$-uniform list assignment $L$, there is an equitable $L$-colouring of $G$ whose each colour class induces an acyclic graph. The smallest number $k$ admitting such a coloring is named equitable
Externí odkaz:
http://arxiv.org/abs/1809.08281
Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with $2n-4$ faulty edges, Information Sciences, 215 (2012) 75--82] observed that the hypercube $Q_n$ is not Hamiltonian if it contains a trap disconnected halfway. A proper subgraph $T$
Externí odkaz:
http://arxiv.org/abs/1803.00064
Autor:
Dybizbański, Janusz1 (AUTHOR) jdybiz@inf.ug.edu.pl
Publikováno v:
Journal of Graph Theory. Sep2023, Vol. 104 Issue 1, p171-187. 17p.
Publikováno v:
In Discrete Applied Mathematics 15 August 2020 282:265-270