Martina Mockovciaková

Learn More
An l-facial edge coloring of a plane graph is a coloring of the edges such that any two edges at distance atmost l on a boundarywalk of any face receive distinct colors. It is conjectured that 3 l + 1 colors suffice for an l-facial edge coloring of any plane graph. We prove that 7 colors suffice for a 2-facial edge coloring of any plane graph and therefore(More)
A sequence is Thue or nonrepetitive if it does not contain a repetition of any length. We consider a generalization of this notion. A j-subsequence of a sequence S is a subsequence in which two consecutive terms are at indices of difference j in S. A k-Thue sequence is a sequence in which every j-subsequence, for 1 6 j 6 k, is also Thue. It was conjectured(More)
A star edge coloring of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this article, we establish tight upper bounds for trees and subcubic outerplanar graphs, Journal of Graph Theory C © 2015 Wiley Periodicals, Inc. 73 74 JOURNAL OF GRAPH THEORY and derive an upper bound for outerplanar graphs. C © 2015 Wiley(More)
  • 1