Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Juraj Valiska"'
Autor:
Michal Staš, Juraj Valiska
Publikováno v:
Opuscula Mathematica, Vol 41, Iss 1, Pp 95-112 (2021)
The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the
Externí odkaz:
https://doaj.org/article/a458dc4cf220491fa4f9a9f0b2e85a67
Autor:
Juraj Valiska, Michal Staš
Publikováno v:
Opuscula Mathematica, Vol 41, Iss 1, Pp 95-112 (2021)
The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67887cfc70365d891b58cc4d39d5a073
https://www.opuscula.agh.edu.pl/vol41/1/art/opuscula_math_4105.pdf
https://www.opuscula.agh.edu.pl/vol41/1/art/opuscula_math_4105.pdf
Autor:
Michal Staš, Juraj Valiska
Publikováno v:
Bulletin of the Australian Mathematical Society. 104:203-210
A connected graph G is $\mathcal {CF}$ -connected if there is a path between every pair of vertices with no crossing on its edges for each optimal drawing of G. We conjecture that a complete bipartite graph $K_{m,n}$ is $\mathcal {CF}$ -connected if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::adfb1b2f1ba3c289cca8d178d8ae1c6f
https://doi.org/10.1017/s000497272000129x
https://doi.org/10.1017/s000497272000129x
Publikováno v:
Discrete Applied Mathematics. 282:80-85
For a fixed positive integer p , a coloring of the edges of a multigraph G is called p -acyclic coloring if every cycle C in G contains at least min { | C | , p + 1 } colors. The least number of colors needed for a p -acyclic coloring of G is the p -
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd2b0c1b39fa2ee89b52454f90e18694
https://doi.org/10.1016/j.dam.2019.11.003
https://doi.org/10.1016/j.dam.2019.11.003
Publikováno v:
Discrete Applied Mathematics. 257:95-100
A facial packing vertex-coloring of a plane graph G is a coloring of its vertices with colors 1 , … , k such that every facial path containing two vertices with the same color i has at least i + 2 vertices. The smallest positive integer k such that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11ddff6f88bd9de45a9b55360f11fcdd
https://doi.org/10.1016/j.dam.2018.10.022
https://doi.org/10.1016/j.dam.2018.10.022
Publikováno v:
Discrete Applied Mathematics. 247:357-366
Let G be a plane graph. A facial path of G is any path which is a consecutive part of the boundary walk of a face of G . Two edges e 1 and e 2 of G are facially adjacent if they are consecutive on a facial path of G . Two edges e 1 and e 3 are facial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::721e4a330f4fb245a7a2b9dcca2e7d4a
https://doi.org/10.1016/j.dam.2018.03.081
https://doi.org/10.1016/j.dam.2018.03.081
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::815b6017b787a0fd8e4a25319df5b93a
https://doi.org/10.7151/dmgt.2135
https://doi.org/10.7151/dmgt.2135
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::957f8774b55d6b093181b86b05f1b96b
https://doi.org/10.7151/dmgt.2036
https://doi.org/10.7151/dmgt.2036
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 2, Pp 353-368 (2017)
Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::571d1c60066166335b1e8f09fe4caa76
https://doi.org/10.7151/dmgt.1921
https://doi.org/10.7151/dmgt.1921