39,896 research outputs found
On clique-colouring of graphs with few P4's
Abstract
Let G=(V,E) be a graph with n vertices. A clique-colouring of a graph is a colouring of its vertices such that no maximal clique of size at least two is monocoloured. A k-clique-colouring is a clique-colouring that uses k colours. The clique-chromatic number of a graph G is the minimum k such that G has a k-clique-colouring.
In this paper we will use the primeval decomposition technique to find the clique-chromatic number and the clique-colouring of well known classes of graphs that in some local sense contain few P
4's. In particular we shall consider the classes of extended P
4-laden graphs, p-trees (graphs which contain exactly nâ3 P
4's) and (q,qâ3)-graphs, qâ„7, such that no set of at most q vertices induces more that qâ3 distincts P
4's. As corollary we shall derive the clique-chromatic number and the clique-colouring of the classes of cographs, P
4-reducible graphs, P
4-sparse graphs, extended P
4-reducible graphs, extended P
4-sparse graphs, P
4-extendible graphs, P
4-lite graphs, P
4-tidy graphs and P
4-laden graphs that are included in the class of extended P
4-laden graphs
Restricted coloring problems on graphs with few P4's
International audienceIn this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number and the harmonious chromatic number of P4-tidy graphs and (q,q â 4)-graphs, for every fixed q. These classes include cographs, P4-sparse and P4-lite graphs. We also obtain a polynomial time algorithm to determine the Grundy number of (q,q â 4)-graphs. All these coloring problems are known to be NP-hard for general graphs
Structural properties of 1-planar graphs and an application to acyclic edge coloring
A graph is called 1-planar if it can be drawn on the plane so that each edge
is crossed by at most one other edge. In this paper, we establish a local
property of 1-planar graphs which describes the structure in the neighborhood
of small vertices (i.e. vertices of degree no more than seven). Meanwhile, some
new classes of light graphs in 1-planar graphs with the bounded degree are
found. Therefore, two open problems presented by Fabrici and Madaras [The
structure of 1-planar graphs, Discrete Mathematics, 307, (2007), 854-865] are
solved. Furthermore, we prove that each 1-planar graph with maximum degree
is acyclically edge -choosable where
.Comment: Please cite this published article as: X. Zhang, G. Liu, J.-L. Wu.
Structural properties of 1-planar graphs and an application to acyclic edge
coloring. Scientia Sinica Mathematica, 2010, 40, 1025--103
On the Grundy number of graphs with few P4's
International audienceThe Grundy number of a graph G is the largest number of colors used by any execution of the greedy algorithm to color G. The problem of determining the Grundy number of G is polynomial if G is a P4-free graph and NP-hard if G is a P5-free graph. In this article, we define a new class of graphs, the fat-extended P4-laden graphs, and we show a polynomial time algorithm to determine the Grundy number of any graph in this class. Our class intersects the class of P5-free graphs and strictly contains the class of P4-free graphs. More precisely, our result implies that the Grundy number can be computed in polynomial time for any graph of the following classes: P4-reducible, extended P4-reducible, P4-sparse, extended P4-sparse, P4-extendible, P4-lite, P4-tidy, P4-laden and extended P4-laden, which are all strictly contained in the fat-extended P4-laden class
- âŠ