7 citations · 19 across the 13 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
Extending edge colorings of distance-3 matchings in the Cartesian product of graphs
Pál Bärnkopf, Ervin Győri
We investigate the problem of extending partial edge colorings in Cartesian products of graphs, with a particular focus on cases where the precolored edges form a matching. Casselg…
math.CO2023★ 1 cited
A new construction for planar Turán number of cycle
Ervin Győri, Kitti Varga, Xiutao Zhu
The planar Turán number is the largest number of edges in an -vertex planar graph with no cycle of length . Let and be constan…