daniel-kral documents

Hamilton cycles in strong products of graphs
Documents Hamilton cycles in strong products of graphs
Coloring graphs from lists with bounded size of their union
Documents Coloring graphs from lists with bounded size of their union
A note on group colorings
Documents A note on group colorings
Hamiltonian threshold for strong products of graphs
Documents Hamiltonian threshold for strong products of graphs
The last excluded case of Dirac's map-color theorem for choosability
Documents The last excluded case of Dirac's map-color theorem for choosability
Coloring plane graphs with independent crossings
Documents Coloring plane graphs with independent crossings
Domination number of cubic graphs with large girth
Documents Domination number of cubic graphs with large girth
Circular edge-colorings of cubic graphs with girth six
Documents Circular edge-colorings of cubic graphs with girth six
An exact algorithm for the channel assignment problem
Documents An exact algorithm for the channel assignment problem
Coloring mixed hypertrees
Documents Coloring mixed hypertrees
On maximum face-constrained coloring of plane graphs with no short face cycles
Documents On maximum face-constrained coloring of plane graphs with no short face cycles
Mixed hypergraphs and other coloring problems
Documents Mixed hypergraphs and other coloring problems
Borodin’s conjecture on diagonal coloring is false
Documents Borodin’s conjecture on diagonal coloring is false
Projective, affine, and abelian colorings of cubic graphs
Documents Projective, affine, and abelian colorings of cubic graphs
Distance Constrained Labelings of -minor Free Graphs
Documents Distance Constrained Labelings of -minor Free Graphs
Characterization of affine Steiner triple systems and Hall triple systems
Documents Characterization of affine Steiner triple systems and Hall triple systems
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
Documents Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
A combinatorial proof of the Removal Lemma for Groups
Documents A combinatorial proof of the Removal Lemma for Groups
Group coloring is -complete
Documents Group coloring is -complete
It is tough to be a plumber
Documents It is tough to be a plumber
Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice
Documents Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice