A result on co-chromatic graphs.

Farrell, E.J.

Displaying similar documents to “A result on co-chromatic graphs.”

Certificates of factorisation for chromatic polynomials.

Morgan, Kerri, Farr, Graham (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On Large Chromatic Graphs Not Containing Prescribed Subgraphs

A. Hajnal (1985)

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

Similarity:

The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six

Halina Bielak (1998)

Discussiones Mathematicae Graph Theory

Similarity:

In this note, all chromatic equivalence classes for 2-connected 3-chromatic graphs with five triangles and cyclomatic number six are described. New families of chromatically unique graphs of order n are presented for each n ≥ 8. This is a generalization of a result stated in [5]. Moreover, a proof for the conjecture posed in [5] is given.

Certificates of factorisation for a class of triangle-free graphs.

Morgan, Kerri, Farr, Graham (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Graphs with chromatic roots in the interval $(1, 2)$ .

Royle, Gordon F. (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

An attractive class of bipartite graphs

Rodica Boliac, Vadim Lozin (2001)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.