Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
On a k-clique-join of a class of partitionable graphs
Authors: Mihai Talmaciu
Keywords: Perfect graphs, (α, ω)-partitionable graphs, [p,q,r]-partite graphs, k-clique-join.
– 0.15 Mb
Keywords: Perfect graphs, (α, ω)-partitionable graphs, [p,q,r]-partite graphs, k-clique-join.
Abstract
We call a graph G O-graph if there is an optimal coloring of the set of vertices and an optimal (disjoint) covering with cliques such that any class of colors intersects any clique. In this paper, it has been established the relation to [p,q,r]-partite graphs and the fact that the O-graphs admit a k-clique-join.M. Talmaciu
Department of Mathematics, University of Bacau,
Spiru Haret, 8, 600114, Bacau, Romania
E-mail:
Department of Mathematics, University of Bacau,
Spiru Haret, 8, 600114, Bacau, Romania
E-mail:
Fulltext
– 0.15 Mb
Contents
- An Automatic Proof of Euler's Formula
- A generalization of the chromatic polynomial of a cycle
- Nash equilibria sets in mixed extension of 2x2x2 games
- The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
- On a k-clique-join of a class of partitionable graphs
- On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles
- The solution of problem of objects classification as the method of restoration of objects images
- Generic Interfaces for Managing Web Data
- Variable Bit Permutations: Linear Characteristics and Pure VBP-Based Cipher
- Abstracts of Dr. Thesis
