Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Maceková, Mária"'
Autor:
Lužar, Borut, Maceková, Mária, Rindošová, Simona, Soták, Roman, Sroková, Katarína, Štorgel, Kenny
A graph is {\em locally irregular} if no two adjacent vertices have the same degree. A {\em locally irregular edge-coloring} of a graph $G$ is such an (improper) edge-coloring that the edges of any fixed color induce a locally irregular graph. Among
Externí odkaz:
http://arxiv.org/abs/2210.04649
Publikováno v:
In Applied Mathematics and Computation 1 June 2024 470
Autor:
Lužar, Borut, Maceková, Mária, Rindošová, Simona, Soták, Roman, Sroková, Katarína, Štorgel, Kenny
Publikováno v:
In Discrete Applied Mathematics 15 November 2023 339:136-148
Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs are such, m
Externí odkaz:
http://arxiv.org/abs/1809.09347
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 345-354 (2020)
An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following holds: (i) v = u, (ii) e = f, or (iii) edge vu is from the set {e,
Externí odkaz:
https://doaj.org/article/d1d52f41d2de41e486f04a6a2dcb371d
Autor:
Čekanová, Katarína1 (AUTHOR), Maceková, Mária1 (AUTHOR), Soták, Roman1 (AUTHOR) roman.sotak@upjs.sk
Publikováno v:
Journal of Graph Theory. Nov2022, Vol. 101 Issue 3, p428-454. 27p.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 2, Pp 339-353 (2016)
In this paper we study the existence of unavoidable paths on three vertices in sparse graphs. A path uvw on three vertices u, v, and w is of type (i, j, k) if the degree of u (respectively v, w) is at most i (respectively j, k). We prove that every g
Externí odkaz:
https://doaj.org/article/40499ff77ef147e6820a1bf1525dab23
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 1, Pp 227-238 (2016)
A graph H is defined to be light in a graph family 𝒢 if there exist finite numbers φ(H, 𝒢) and w(H, 𝒢) such that each G ∈ 𝒢 which contains H as a subgraph, also contains its isomorphic copy K with ΔG(K) ≤ φ(H, 𝒢) and ∑x∈V(K)
Externí odkaz:
https://doaj.org/article/b2e27a41f4b644c8a73e702440b74d70
The minimum number of colors needed for incidence coloring of a graph is called the incidence chromatic number. In this paper we present some results on graphs regarding their maximum degree and maximum average degree. We improve the bound for planar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______8936::a4dd65f53b321cf455b3874bb0254dc2
http://hdl.handle.net/11025/36701
http://hdl.handle.net/11025/36701
Publikováno v:
The 6th Gdańsk Workshop on Graph Theory, GWGT'18
The 6th Gdańsk Workshop on Graph Theory, GWGT'18, 2018, Gdansk, Poland
The 6th Gdańsk Workshop on Graph Theory, GWGT'18, 2018, Gdansk, Poland
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b4987e5768a8c308100fc0e005e26fae
https://hal.archives-ouvertes.fr/hal-02264670
https://hal.archives-ouvertes.fr/hal-02264670