8 citations · 32 across the 22 of their papers we have counts for
22 papers
Bipartite graphs are -choosable
Peter Bradshaw, Bojan Mohar, Ladislav Stacho
Alon and Krivelevich conjectured that if is a bipartite graph of maximum degree , then the choosability (or list chromatic number) of satisfies $χ_{\ell}(G) = O \left (…
A cornering strategy for synchronizing a DFA
Peter Bradshaw, Alexander Clow, Ladislav Stacho
This paper considers the existence of short synchronizing words in deterministic finite automata (DFAs). We define two general strategies for generating synchronizing words, and we…
Oriented Colouring Graphs of Bounded Degree and Degeneracy
Alexander Clow, Ladislav Stacho
This paper considers upper bounds on the oriented chromatic number , of an oriented graph in terms of its -dipath chromatic number , degeneracy , and m…
Hamiltonicity of covering graphs of trees
Peter Bradshaw, Zhilin Ge, Ladislav Stacho
In this paper, we consider covering graphs obtained by lifting a tree with a loop at each vertex as a voltage graph over a cyclic group. We generalize a tool of Hell, Nishiyama, an…
Robust Connectivity of Graphs on Surfaces
Peter Bradshaw, Tomáš Masařík, Jana Novotná +1
Let denote the set of leaves in a tree . One natural problem is to look for a spanning tree of a given graph such that is as large as possible. This proble…
From one to many rainbow Hamiltonian cycles
Peter Bradshaw, Kevin Halasz, Ladislav Stacho
Given a graph and a family of subgraphs of , a transversal of is a pair such that and $ϕ: T \righ…