Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Czap Július"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 3, Pp 801-808 (2021)
Let G be a plane graph. A facial path of G is a subpath of the boundary walk of a face of G. We prove that each plane graph admits a 3-coloring (a 2-coloring) such that every monochromatic facial path has at most 3 vertices (at most 4 vertices). Thes
Externí odkaz:
https://doaj.org/article/6ded0d4cff144b319d22fde09b52b8df
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 1, Pp 5-38 (2021)
A cyclic coloring of a plane graph is a vertex coloring such that any two vertices incident with the same face receive distinct colors. This type of coloring was introduced more than fifty years ago, and a lot of research in chromatic graph theory wa
Externí odkaz:
https://doaj.org/article/2cf660674efe40b4bee202b6b082fac2
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 3, Pp 629-645 (2019)
Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the boundary walk of a face of G. Given nonnegative integers r, s, and t, a facial [r, s, t]-coloring of a plane graph G = (V,E) is a mapping f : V ∪ E
Externí odkaz:
https://doaj.org/article/503532a100dd409185c86afffc25879f
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 4, Pp 911-920 (2018)
An edge-colored graph G is conflict-free connected if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. In this paper the question for the smallest number of colors needed for a coloring of edge
Externí odkaz:
https://doaj.org/article/41c9c3014fa146848d3a51eeeff99d75
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 1, Pp 141-151 (2016)
A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets. Bipartite 1-planar graphs ar
Externí odkaz:
https://doaj.org/article/468b1f7c1b194ab4a4ea4713f3037831
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 1, Pp 59-69 (2016)
An edge coloring φ of a graph G is called an M2-edge coloring if |φ(v)| ≤ 2 for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let 𝒦2(G) denote the maximum number of colors used in an M2-edge coloring of G. In
Externí odkaz:
https://doaj.org/article/fbd9fb5aa4174dd4a403300e52c7653f
Autor:
Czap Július, Tuza Zsolt
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 3, Pp 521-530 (2013)
An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each
Externí odkaz:
https://doaj.org/article/6255435f153c423ca35ffc5817781fa2
Autor:
Czap Július, Mihók Peter
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 3, Pp 509-519 (2013)
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let be an additive hereditary property of graphs. A -edge-coloring of a simple graph is an edge coloring in which the edges
Externí odkaz:
https://doaj.org/article/dcf06140f4b34e12ab38fa3b7cd65fc0
Autor:
Czap, Július1 julius.czap@tuke.sk
Publikováno v:
Opuscula Mathematica. 2024, Vol. 44 Issue 6, p815-825. 11p.
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.