Displaying similar documents to “Deciding clique-width for graphs of bounded tree-width.”

Inductive computations on graphs defined by clique-width expressions

Frédérique Carrère (2009)

RAIRO - Theoretical Informatics and Applications

Similarity:

Labelling problems for graphs consist in building distributed data structures, making it possible to check a given graph property or to compute a given function, the arguments of which are vertices. For an inductively computable function , if is a graph with vertices and of clique-width at most , where is fixed, we can associate with each vertex of a piece of information (bit sequence) lab(x) of length (log()) such that we can compute in constant time, using only the labels...

The disjoint cliques problem

Klaus Jansen, Petra Scheffler, Gerhard Woeginger (1997)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

Fatemeh Alinaghipour Taklimi, Shaun Fallat, Karen Meagher (2014)

Special Matrices

Similarity:

The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all the vertices of the graph, while the positive zero forcing number is an upper bound on the minimum number of induced trees in the graph needed to cover all the vertices in the graph. We show that for a block-cycle graph the zero forcing...

On graceful trees.

Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)

Applied Mathematics E-Notes [electronic only]

Similarity:

Extended trees of graphs

Bohdan Zelinka (1994)

Mathematica Bohemica

Similarity:

An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.