# Search results for: Stanislav Jendrol’

Graphs and Combinatorics > 2018 > 34 > 6 > 1553-1563

*G*is

*conflict-free connected*if every two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The

*conflict-free connection number*of a connected graph

*G*, denoted by

*cfc*(

*G*), is the smallest number of colors needed in order to make

*G*conflict-free connected. For a graph

*G*, let

*C*(

*G*) be the subgraph of

*G*induced by its set of cut-edges...

Graphs and Combinatorics > 2018 > 34 > 4 > 669-676

*G*is a

*facial rainbow edge-coloring*if any two edges of

*G*contained in the same facial path have distinct colors. The

*facial rainbow edge-number*of a graph

*G*, denoted $$\mathrm {erb}(G)$$ erb(G) , is the minimum number of colors that are necessary in any facial rainbow edge-coloring. In the present note we prove that $$\mathrm {erb}(G) \le \lfloor \frac{3}{2}...

Discrete Mathematics > 2017 > 340 > 11 > 2691-2703

Discrete Applied Mathematics > 2017 > 230 > C > 151-155

Electronic Notes in Discrete Mathematics > 2017 > 60 > C > 25-31

Discrete Applied Mathematics > 2016 > 213 > C > 71-75

Discrete Mathematics > 2016 > 339 > 11 > 2826-2831

Electronic Notes in Discrete Mathematics > 2016 > 55 > C > 143-146

Discussiones Mathematicae Graph Theory > 2016 > 36 > 3 > 565-575

Discrete Mathematics > 2016 > 339 > 7 > 1978-1984

Discussiones Mathematicae Graph Theory > 2016 > 36 > 2 > 339-353

Discussiones Mathematicae Graph Theory > 2016 > 36 > 1 > 117-125

Graphs and Combinatorics > 2016 > 32 > 3 > 997-1012

*G*is the minimum of weights of edges of

*G*. Jendrol’ and Schiermeyer (Combinatorica

**21**:351–359, 2001) determined the maximum weight of a graph having

*n*vertices and

*m*edges, thus solving a problem posed in 1990 by Erdős. The present paper is concerned with a modification of the...

Discrete Applied Mathematics > 2015 > 194 > C > 60-64

Electronic Notes in Discrete Mathematics > 2015 > 48 > Complete > 19-26

Discrete Applied Mathematics > 2015 > 185 > Complete > 239-243

Journal of Graph Theory > 78 > 4 > 248 - 257

*C*

_{3}in any

*n*‐vertex plane triangulation is equal to $\lfloor \frac{3n-4}{2}\rfloor $. For $k\ge 4$ a lower bound and for $k\in \{4,5\}$ an upper bound of the number $\mathrm{rb}({T}_{n},{C}_{k})$ is determined.

Discussiones Mathematicae Graph Theory > 2014 > 34 > 4 > 849-855

Discrete Mathematics > 2014 > 331 > Complete > 158-164

Discussiones Mathematicae Graph Theory > 2014 > 34 > 2 > 421-426