The complexity of some acyclic improper colourings

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Acyclic improper colourings of graphs with bounded maximum degree

For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour classes is acyclic and each colour class induces a graph with maximum degree at most t. We consider the supremum, over all graphs of maximum degree at most d, of the acyclic t-improper chromatic number and provide t-impr...

متن کامل

Acyclic improper colourings of graphs with bounded degree

In this paper, we continue the study of acyclic improper colourings of graphs introduced in a previous work. An improper colouring of a graph G is a mapping c from the set of vertices of G to a set of colours such that for every colour i, the subgraph induced by the vertices with colour i satisses some property depending on i. Such an improper colouring is acyclic if for every two distinct colo...

متن کامل

Acyclic T -improper Colourings of Graphs with Bounded Maximum Degree

For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour classes is acyclic and each colour class induces a graph with maximum degree at most t. In the first part, we show that all subcubic graphs are acyclically 1-improperly 3-choosable, thus extending a result of Boiron, Sop...

متن کامل

Acyclic improper choosability of graphs

We consider improper colorings (sometimes called generalized, defective or relaxed colorings) in which every color class has a bounded degree. We propose a natural extension of improper colorings: acyclic improper choosability. We prove that subcubic graphs are acyclically (3,1)∗-choosable (i.e. they are acyclically 3-choosable with color classes of maximum degree one). Using a linear time algo...

متن کامل

Acyclic Improper Colorings of Graphs

In this paper, we introduce the new notion of acyclic improper colorings of graphs. An improper coloring of a graph G is a mapping c from the set of vertices of G to a set of colors such that for every color i, the subgraph induced by the vertices with color i satisses some property depending on i. Such an improper coloring is acyclic if for every two distinct colors i and j, the subgraph induc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2011

ISSN: 0012-365X

DOI: 10.1016/j.disc.2011.01.023