DOIAbstract
AbstractA general graph partitioning problem, which includes graph colouring, homomorphism to H, conditional colouring, contractibility to H, and partition into cliques as special cases, is introduced and its complexity is studied
AbstractA general graph partitioning problem, which includes graph colouring, homomorphism to H, conditional colouring, contractibility to H, and partition into cliques as special cases, is introduced and its complexity is studied
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and...
general graph homomorphism polynomial: Its relationship with other graph polynomials an
AbstractWe first introduce the concept of the k-chromatic index of a graph, and then discuss some of...
AbstractA general graph partitioning problem, which includes graph colouring, homomorphism to H, con...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
Abstract. We introduce the partition function of edge-colored graph homomor-phisms, of which the usu...
Abstract. We introduce the partition function of edge-colored graph homomor-phisms, of which the usu...
We discuss four variants of the graph colouring problem, and present algorithms for solving them. Th...
We discuss four variants of the graph colouring problem, and present algorithms for solving them. Th...
The matrix partition problem has been of recent interest in graph theory. Matrix partitions generali...
The generalized graph colouring problem (GCOL) for a fixed integer k, and fixed classes of graphs P_...
. We study the computational complexity of partitioning the vertices of a graph into generalized dom...
AbstractWe give a complexity theoretic classification of the counting versions of so-called H-colour...
Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of...
AbstractIn this paper we have investigated mainly the three colouring parameters of a graph G, viz.,...
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and...
general graph homomorphism polynomial: Its relationship with other graph polynomials an
AbstractWe first introduce the concept of the k-chromatic index of a graph, and then discuss some of...
AbstractA general graph partitioning problem, which includes graph colouring, homomorphism to H, con...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
Abstract. We introduce the partition function of edge-colored graph homomor-phisms, of which the usu...
Abstract. We introduce the partition function of edge-colored graph homomor-phisms, of which the usu...
We discuss four variants of the graph colouring problem, and present algorithms for solving them. Th...
We discuss four variants of the graph colouring problem, and present algorithms for solving them. Th...
The matrix partition problem has been of recent interest in graph theory. Matrix partitions generali...
The generalized graph colouring problem (GCOL) for a fixed integer k, and fixed classes of graphs P_...
. We study the computational complexity of partitioning the vertices of a graph into generalized dom...
AbstractWe give a complexity theoretic classification of the counting versions of so-called H-colour...
Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of...
AbstractIn this paper we have investigated mainly the three colouring parameters of a graph G, viz.,...
In this thesis we study algorithmic aspects of two graph partitioning problems -- graph coloring and...
general graph homomorphism polynomial: Its relationship with other graph polynomials an
AbstractWe first introduce the concept of the k-chromatic index of a graph, and then discuss some of...
Add to ORKG