167 citations · 167 across the 3 of their papers we have counts for
5 papers
Strengthening a theorem of Meyniel
Quentin Deschamps, Carl Feghali, František Kardoš +2
For an integer and a graph , let be the graph that has vertex set all proper -colorings of , and an edge between two vertices and~ whe…
On the 4-color theorem for signed graphs
František Kardoš, Jonathan Narboni
There are several ways to generalize graph coloring to signed graphs. Máčajová, Raspaud and Škoviera introduced one of them and conjectured that in this setting, for signed planar…
The structure of binary matroids with no induced claw or Fano plane restriction
Marthe Bonamy, Frantisek Kardos, Tom Kelly +2
An 'induced restriction' of a simple binary matroid is a restriction , where is a flat of . We consider the class of all simple binary matroids co…
Minimum k-path vertex cover
Boštjan Brešar, František Kardoš, Ján Katrenič +1
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψ_k(G) the minimum cardinality of a…
Fractional colorings of cubic graphs with large girth
Frantisek Kardos, Daniel Kral, Jan Volec
We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size…