Displaying similar documents to “Chromatic numbers of the strong product of odd cycles”

On hypergraphs of girth five.

Lazebnik, Felix, Verstraëte, Jacques (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Edge-disjoint odd cycles in graphs with small chromatic number

Claude Berge, Bruce Reed (1999)

Annales de l'institut Fourier

Similarity:

For a simple graph, we consider the minimum number of edges which block all the odd cycles and the maximum number of odd cycles which are pairwise edge-disjoint. When these two coefficients are equal, interesting consequences appear. Similar problems (but interchanging “ odd cycles” and “ odd cycles”) have been considered in a paper by Berge and Fouquet.

A note on total colorings of planar graphs without 4-cycles

Ping Wang, Jian-Liang Wu (2004)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a 2-connected planar graph with maximum degree Δ such that G has no cycle of length from 4 to k, where k ≥ 4. Then the total chromatic number of G is Δ +1 if (Δ,k) ∈ {(7,4),(6,5),(5,7),(4,14)}.