6 Result(s)
within
Pavel Dvořák
Discrete Mathematics in Computer Science
-
Chapter and Conference Paper
Bounds on Functionality and Symmetric Difference – Two Intriguing Graph Parameters
[Alecu et al.: Graph functionality, JCTB2021] define functionality, a graph parameter that generalizes graph degeneracy. They research the relation of functionality to many other graph parameters (tree-width, ...
-
Chapter and Conference Paper
Correction to: Bears with Hats and Independence Polynomials
Chapter [“Bears with Hats and Independence Polynomials”] was previously published non-open access. It has now been changed to open access under a CC BY 4.0 license and the copyright holder updated to ‘The Auth...
-
Chapter and Conference Paper
Bears with Hats and Independence Polynomials
Consider the following hat guessing game. A bear sits on each vertex of a graph G, and a demon puts on each bear a hat colored by one of h colors. Each bear sees only the hat colors of his neighbors. Based on thi...
-
Chapter and Conference Paper
Parameterized Inapproximability of Independent Set in H-Free Graphs
We study the Independent Set problem in H-free graphs, i.e., graphs excluding some fixed graph H as an induced subgraph. We prove several inapproximability results both for polynomial-time and parameterized algor...
-
Chapter and Conference Paper
On Induced Online Ramsey Number of Paths, Cycles, and Trees
An online Ramsey game is a game between Builder and Painter, alternating in turns. They are given a fixed graph H and a an infinite set of independent vertices G. In each round Builder draws a new edge in G and P...
-
Chapter and Conference Paper
Automorphisms of the Cube \(n^d\)
Consider a hypergraph \(H_n^d\) where the vertices are points of the d-dimensional combinatorial cube ...
