Zobrazeno 1 - 10
of 129
pro vyhledávání: '"Pilśniak Monika"'
Autor:
Pilsniak, Monika, Wozniak, Mariusz
We consider edge colorings of a graph in such a way that each two different triangles have distinct colorings. It is an extension of the well-known idea of distinguishing all maximal stars in a graph. It was introduced in literature in 1985 and studi
Externí odkaz:
http://arxiv.org/abs/2407.19050
Autor:
Baudon Olivier, Hocquard Hervé, Marczyk Antoni, Pilśniak Monika, Przybyło Jakub, Woźniak Mariusz
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 4, Pp 1175-1186 (2020)
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1, . . . , k}. These colors can be used to distinguish adjacent vertices of G. There are many possibilities of such a distinction. In this paper, we foc
Externí odkaz:
https://doaj.org/article/78d65607858d4c3ea2b34a04a1b5f587
The $3$-colourability problem is a well-known NP-complete problem and it remains NP-complete for $bull$-free graphs, where $bull$ is the graph consisting of $K_3$ with two pendant edges attached to two of its vertices. In this paper we study $3$-colo
Externí odkaz:
http://arxiv.org/abs/2404.12515
A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex $v$ and every color $\alpha$, there are at most as many edges incident to $v$ colored with $\alpha$ as with all other colors. We extend s
Externí odkaz:
http://arxiv.org/abs/2312.00922
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 1, Pp 155-164 (2017)
The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism. In this paper we improve results about the distinguishing number of Ca
Externí odkaz:
https://doaj.org/article/86f68956ec164756bb7a7ff443aad0f7
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 1, Pp 89-115 (2017)
A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, . . . , np) of |V (G)| there exists a partition (V1, . . . , Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. Some
Externí odkaz:
https://doaj.org/article/d159d66a65894a2f9dc91afdd2974437
Let $G$ and $H$ be graphs and let $f \colon V(G)\rightarrow V(H)$ be a function. The Sierpi\'{n}ski product of $G$ and $H$ with respect to $f$, denoted by $G \otimes _f H$, is defined as the graph on the vertex set $V(G)\times V(H)$, consisting of $|
Externí odkaz:
http://arxiv.org/abs/2309.15409
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 1, Pp 5-22 (2016)
A graph G of order n is called arbitrarily partitionable (AP for short) if, for every sequence (n1, . . . , nk) of positive integers with n1 + ⋯ + nk = n, there exists a partition (V1, . . . , Vk) of the vertex set V (G) such that Vi induces a conn
Externí odkaz:
https://doaj.org/article/70a1d709dcf94ec783d7ba30b933b4ea
Let $C_{n_1}\cup C_{n_2}\cup \ldots \cup C_{n_k}$ be a 2-factor i.e. a vertex-disjoint union of cycles. In this note we completely characterize those 2-factors that are uniquely embeddeble in their complement.
Comment: 16 pages, 12 figures
Comment: 16 pages, 12 figures
Externí odkaz:
http://arxiv.org/abs/2304.12915
A graph $G$ is asymmetrizable if it has a set of vertices whose setwise stablizer only consists of the identity automorphism. The motion $m$ of a graph is the minimum number of vertices moved by any non-identity automorphism. It is known that infinit
Externí odkaz:
http://arxiv.org/abs/2301.10380