Displaying similar documents to “The disjoint cliques problem”

Tree-Like Partial Hamming Graphs

Tanja Gologranc (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227-240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and give a new proof of that result, which holds also for a bigger class of graphs, so called tree-like...

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...