On chromatic number of products of two graphs

M. Borowiecki

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “On chromatic number of products of two graphs”

A note on (k,l)-kernels in B-products of graphs

Iwona Włoch (1996)

Discussiones Mathematicae Graph Theory

Similarity:

B-products of graphs and their generalizations were introduced in [4]. We determined the parameters k, l of (k,l)-kernels in generalized B-products of graphs. These results are generalizations of theorems from [2].

Chromatic number of products of graphs

Vladimír Puš (1988)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

On Large Chromatic Graphs Not Containing Prescribed Subgraphs

A. Hajnal (1985)

Publications du Département de mathématiques (Lyon)

Similarity:

On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs

Robert Janczewski, Michał Małafiejski, Anna Małafiejska (2018)

Discussiones Mathematicae Graph Theory

Similarity:

A Generalized Direct Product Of Graphs

Risto Šokarovski (1977)

Publications de l'Institut Mathématique

Similarity:

A note on intersecting graphs.

Bretto, A. (1999)

Southwest Journal of Pure and Applied Mathematics [electronic only]

Similarity:

Chord graphs - new means for representing graphs

W. Wessel (1987)

Applicationes Mathematicae

Similarity:

'3in1' enhanced: three squared ways to '3in1' GRAPHS

Zdzisław Skupień (2007)

Discussiones Mathematicae Graph Theory

Similarity:

Some globally determined classes of graphs

Ivica Bošnjak, Rozália Madarász (2018)

Czechoslovak Mathematical Journal

Similarity:

For a class of graphs we say that it is globally determined if any two nonisomorphic graphs from that class have nonisomorphic globals. We will prove that the class of so called CCB graphs and the class of finite forests are globally determined.