Displaying similar documents to “On the total coloring of planar graphs.”

On the cost chromatic number of outerplanar, planar, and line graphs

John Mitchem, Patrick Morriss, Edward Schmeichel (1997)

Discussiones Mathematicae Graph Theory

Similarity:

We consider vertex colorings of graphs in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of the coloring is the sum of the costs incurred at each vertex. The cost chromatic number of a graph with respect to a cost set is the minimum number of colors necessary to produce a minimum cost coloring of the graph. We show that the cost chromatic number of maximal outerplanar and maximal planar graphs can be arbitrarily large and...

Remarks on the existence of uniquely partitionable planar graphs

Mieczysław Borowiecki, Peter Mihók, Zsolt Tuza, M. Voigt (1999)

Discussiones Mathematicae Graph Theory

Similarity:

We consider the problem of the existence of uniquely partitionable planar graphs. We survey some recent results and we prove the nonexistence of uniquely (𝓓₁,𝓓₁)-partitionable planar graphs with respect to the property 𝓓₁ "to be a forest".

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.

A characterization of planar median graphs

Iztok Peterin (2006)

Discussiones Mathematicae Graph Theory

Similarity:

Median graphs have many interesting properties. One of them is-in connection with triangle free graphs-the recognition complexity. In general the complexity is not very fast, but if we restrict to the planar case the recognition complexity becomes linear. Despite this fact, there is no characterization of planar median graphs in the literature. Here an additional condition is introduced for the convex expansion procedure that characterizes planar median graphs.