5 papers
Rainbow connecting -colorings of super-Dirac graphs
János Barát, Simona Boyadzhiyska, Andrea Freschi
Let be a graph with minimum degree . Can we color the edges of with red and blue so that every pair of non-adjacent vertices is connected by a path consist…
Matchings avoiding ordered patterns
János Barát, Andrea Freschi, Géza Tóth
A {\it vertex-ordered} graph is a graph equipped with a linear ordering of its vertices. A pair of independent edges in an ordered graph can exhibit one of the following three patt…
Open problems of the 33rd Workshop on Cycles and Colourings
János Barát, Zdeněk Dvořák, Penny Haxell +6
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current st…
On the number of edges in saturated partial embeddings of maximal planar graphs
János Barát, Zoltán L. Blázsik, Balázs Keszegh +1
We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph , the plane-saturation number $\mathrm{sat}_{\mathcal{P…
Open problems of the 32nd Workshop on Cycles and Colourings
János Barát, Stijn Cambie, Geňa Hahn +4
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current st…