Kardoš, František

1. Sandwiching saturation number of fullerene graphs
   2014/05/09 by Vesna Andova, Andova, Vesna, Kardoš, František +1 · 2 citations
   Chemistry · Materials Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Fullerene Chemistry and Applications #Graph theory and applications #Graphene research and applications
2. On the 4-color theorem for signed graphs
   2019/06/13 by Kardoš, František, Narboni, Jonathan · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
3. Subcubic planar graphs of girth 7 are class I
   2021/08/13 by Sebastien Bonduelle, František Kardoš, Bonduelle, Sebastien +1 · 1 citation
   Computer Science · #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
4. Strengthening a theorem of Meyniel
   2022/01/19 by Deschamps, Quentin, Feghali, Carl, Kardoš, František +2 · 1 citation
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
5. An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
   2025/01/20 by Lucas De Meyer, František Kardoš, De Meyer, Lucas +5 · 1 citation
   Computer Science · #Machine Learning and Algorithms