Výsledky vyhledávání - "Mariusz Hałuszczak"

On the structure and deficiency of k-trees with bounded degree

Autor: Mariusz Hałuszczak, Ewa Drgas-Burchardt, Marta Borowiecka-Olszewska

Publikováno v: Discrete Applied Mathematics. 201:24-37

A?proper edge colouring of a?graph with natural numbers is consecutive if colours of edges incident with each vertex form a?consecutive interval of integers. The?deficiency d e f ( G ) of a?graph G is the?minimum number of pendant edges whose attachm

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bcd617756ed9f1d5dc67876d7a87204a
https://doi.org/10.1016/j.dam.2015.08.008

Zobrazit plný text záznamu

Acyclic chromatic indices of fully subdivided graphs

Autor: Mariusz Hałuszczak, Anna Fiedorowicz

Publikováno v: Information Processing Letters. 112:557-561

Let G=(V,E) be any finite simple graph. A mapping @f:E->[k] is called an acyclic edge k-colouring of G, if any two adjacent edges have different colours and there are no bichromatic cycles in G. The smallest number k of colours such that G has an acy

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::085ad46c2866dcf8b94a362c7358e1df
https://doi.org/10.1016/j.ipl.2012.04.004

Zobrazit plný text záznamu

About acyclic edge colourings of planar graphs

Autor: Anna Fiedorowicz, Mariusz Hałuszczak, N. Narayanan

Publikováno v: Information Processing Letters. 108:412-417

Let G=(V,E) be any finite simple graph. A mapping C:E->[k] is called an acyclic edge k-colouring of G, if any two adjacent edges have different colours and there are no bichromatic cycles in G. In other words, for every pair of distinct colours i and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::babdad0ce6cf86b05074990527c814fb
https://doi.org/10.1016/j.ipl.2008.07.016

Zobrazit plný text záznamu

Schttes Tournament Problem and Intersecting Families of Sets

Autor: Mieczysław Borowiecki, Zsolt Tuza, Mariusz Hałuszczak, Jarosław Grytczuk

Publikováno v: Combinatorics, Probability and Computing. 12:359-364

In this paper we consider a bipartite version of Schutte's well-known tournament problem. A bipartite tournament $T=(A,B,E)$ with teams $A$ and $B$, and set of arcs $E$, has the property $S_{k,l}$ if for any subsets $K\subseteq A$ and $L\subseteq B$,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5b02e3711c1c55aceb18fe11e503859d
https://doi.org/10.1017/s0963548303005674

Zobrazit plný text záznamu

Nonrepetitive colorings of graphs

Autor: Mariusz Hałuszczak, Noga Alon, Jarosław Grytczuk, Oliver Riordan

Publikováno v: Random Structures and Algorithms. 21:336-346

A sequence a = a1a2. . . . an is said to be nonrepetitive if no two adjacent blocks of a are exactly the same. For instance, the sequence 1232321 contains a repetition 2323, while 123132123213 is nonrepetitive. A theorem of Thue asserts that, using o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e9d7b8d1b1b2b3066e19087b47df1254
https://doi.org/10.1002/rsa.10057

Zobrazit plný text záznamu

On-line Ramsey Theory

Autor: Jarosław Grytczuk, Henry A. Kierstead, Mariusz Hałuszczak

Publikováno v: The Electronic Journal of Combinatorics. 11

The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Painter paints it red or blue. The goal of Builder is to force Painter to cr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::273f1c8b9d14c3d3cdd0c062632b4aaf
https://doi.org/10.37236/1810

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání