Add to ORKGAbstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this paper a new class of weakly perfect graphs arising from rings are presented and an explicit formula for the chromatic number of such graphs is given. 1
AbstractLet Gn be a graph of n vertices, having chromatic number r which contains no complete graph ...
M.Sc.This thesis is concerned with one possible interplay between commutative algebra and graph theo...
AbstractWe introduce a graph transformation which preserves the clique number. When applied to graph...
Abstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this...
Abstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this...
Abstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this...
summary:A graph is called weakly perfect if its chromatic number equals its clique number. In this n...
summary:A graph is called weakly perfect if its chromatic number equals its clique number. In this n...
A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let $R$ be...
A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let $R$ be...
AbstractA b-coloring is a coloring of the vertices of a graph such that each color class contains a ...
A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enha...
Let p be a prime number and n be a positive integer. The graph G p (n) is a graph with vertex s...
AbstractIn this paper, we present a new class of graphs named weakly diamond-free (WDF) graphs and w...
Both chordal and weakly chordal graphs have been topics of research in graph theory for many years. ...
AbstractLet Gn be a graph of n vertices, having chromatic number r which contains no complete graph ...
M.Sc.This thesis is concerned with one possible interplay between commutative algebra and graph theo...
AbstractWe introduce a graph transformation which preserves the clique number. When applied to graph...
Abstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this...
Abstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this...
Abstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this...
summary:A graph is called weakly perfect if its chromatic number equals its clique number. In this n...
summary:A graph is called weakly perfect if its chromatic number equals its clique number. In this n...
A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let $R$ be...
A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let $R$ be...
AbstractA b-coloring is a coloring of the vertices of a graph such that each color class contains a ...
A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enha...
Let p be a prime number and n be a positive integer. The graph G p (n) is a graph with vertex s...
AbstractIn this paper, we present a new class of graphs named weakly diamond-free (WDF) graphs and w...
Both chordal and weakly chordal graphs have been topics of research in graph theory for many years. ...
AbstractLet Gn be a graph of n vertices, having chromatic number r which contains no complete graph ...
M.Sc.This thesis is concerned with one possible interplay between commutative algebra and graph theo...
AbstractWe introduce a graph transformation which preserves the clique number. When applied to graph...