1 citations · 2 across the 5 of their papers we have counts for
6 papers
Total coloring of (sub)cubic Halin graphs
František Kardoš, Matúš Matok
Total coloring of a graph is a coloring of its vertices and edges such that adjacent or incident elements receive distinct colors. Total coloring conjecture (stipulating that the t…
Disjoint Correspondence Colorings for -Minor-free Graphs
Wouter Cames van Batenburg, Daniel W. Cranston, František Kardoš
Thomassen famously proved that every planar graph is 5-choosable. We explore variants of this result, focusing on finding disjoint correspondence colorings, in the more general cla…
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…
Circular -coloring of some classes of signed graphs
František Kardoš, Jonathan Narboni, Reza Naserasr +1
A circular -coloring of a signed graph is an assignment of points of a circle of circumference to the vertices of such that for each positive edg…
Fractional vertex-arboricity of planar graphs
Marthe Bonamy, František Kardoš, Tom Kelly +1
We initiate a systematic study of the fractional vertex-arboricity of planar graphs and demonstrate connections to open problems concerning both fractional coloring and the size of…
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles
František Kardoš, Martina Mockovčiaková
A fullerene graph is a 3-connected cubic planar graph with pentagonal and hexagonal faces. The leapfrog transformation of a planar graph produces the trucation of the dual of the g…