1,357 research outputs found
Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs
AbstractHomomorphisms to a given graph H (H-colourings) are considered in the literature among other graph colouring concepts. We restrict our attention to a special class of H-colourings, namely H is assumed to be a star. Our additional requirement is that the set of vertices of a graph G mapped into the central vertex of the star and any other colour class induce in G an acyclic subgraph. We investigate the existence of such a homomorphism to a star of given order. The complexity of this problem is studied. Moreover, the smallest order of a star for which a homomorphism of a given graph G with desired features exists is considered. Some exact values and many bounds of this number for chordal bipartite graphs, cylinders, grids, in particular hypercubes, are given. As an application of these results, we obtain some bounds on the cardinality of the minimum feedback vertex set for specified graph classes
Enumerating -arc-connected orientations
12 pagesWe study the problem of enumerating the -arc-connected orientations of a graph , i.e., generating each exactly once. A first algorithm using submodular flow optimization is easy to state, but intricate to implement. In a second approach we present a simple algorithm with delay and amortized time , which improves over the analysis of the submodular flow algorithm. As ingredients, we obtain enumeration algorithms for the -orientations of a graph in delay and for the outdegree sequences attained by -arc-connected orientations of in delay
Digraph Coloring Games and Game-Perfectness
In this thesis the game chromatic number of a digraph is introduced as a game-theoretic variant of the dichromatic number. This notion generalizes the well-known game chromatic number of a graph. An extended model also takes into account relaxed colorings and asymmetric move sequences. Game-perfectness is defined as a game-theoretic variant of perfectness of a graph, and is generalized to digraphs. We examine upper and lower bounds for the game chromatic number of several classes of digraphs. In the last part of the thesis, we characterize game-perfect digraphs with small clique number, and prove general results concerning game-perfectness. Some results are verified with the help of a computer program that is discussed in the appendix
Recommended from our members
Reducing the cost of applying adaptive test cases
The testing of a state-based system may involve the application of a number of adaptive test cases. Where the implementation under test (IUT) is deterministic, the response of the IUT to some adaptive test case could be capable of determining the response of the IUT to another adaptive test case $\gamma_2". Thus, the expected cost of applying a set of adaptive test cases depends upon the order in which they are applied. This paper explores properties of adaptive test cases and considers the problem of finding an order of application of the elements from some set of adaptive test cases, which minimises the expected cost of testing
- …