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...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2010
|
| _version_ | 1826256751595356160 |
|---|---|
| author | Addario-Berry, L Esperet, L Kang, R McDiarmid, C Pinlou, A |
| author_facet | Addario-Berry, L Esperet, L Kang, R McDiarmid, C Pinlou, A |
| author_sort | Addario-Berry, L |
| collection | OXFORD |
| description | 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-improper analogues of results by Alon, McDiarmid and Reed [N. Alon, C.J.H. McDiarmid, B. Reed, Acyclic coloring of graphs, Random Structures Algorithms 2 (3) (1991) 277-288] and Fertin, Raspaud and Reed [G. Fertin, A. Raspaud, B. Reed, Star coloring of graphs, J. Graph Theory 47 (3) (2004) 163-182]. © 2009. |
| first_indexed | 2024-03-06T18:07:13Z |
| format | Journal article |
| id | oxford-uuid:01d59a5e-170f-443f-ae64-81f70f344c09 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T18:07:13Z |
| publishDate | 2010 |
| record_format | dspace |
| spelling | oxford-uuid:01d59a5e-170f-443f-ae64-81f70f344c092022-03-26T08:37:10ZAcyclic improper colourings of graphs with bounded maximum degreeJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:01d59a5e-170f-443f-ae64-81f70f344c09EnglishSymplectic Elements at Oxford2010Addario-Berry, LEsperet, LKang, RMcDiarmid, CPinlou, AFor 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-improper analogues of results by Alon, McDiarmid and Reed [N. Alon, C.J.H. McDiarmid, B. Reed, Acyclic coloring of graphs, Random Structures Algorithms 2 (3) (1991) 277-288] and Fertin, Raspaud and Reed [G. Fertin, A. Raspaud, B. Reed, Star coloring of graphs, J. Graph Theory 47 (3) (2004) 163-182]. © 2009. |
| spellingShingle | Addario-Berry, L Esperet, L Kang, R McDiarmid, C Pinlou, A Acyclic improper colourings of graphs with bounded maximum degree |
| title | Acyclic improper colourings of graphs with bounded maximum degree |
| title_full | Acyclic improper colourings of graphs with bounded maximum degree |
| title_fullStr | Acyclic improper colourings of graphs with bounded maximum degree |
| title_full_unstemmed | Acyclic improper colourings of graphs with bounded maximum degree |
| title_short | Acyclic improper colourings of graphs with bounded maximum degree |
| title_sort | acyclic improper colourings of graphs with bounded maximum degree |
| work_keys_str_mv | AT addarioberryl acyclicimpropercolouringsofgraphswithboundedmaximumdegree AT esperetl acyclicimpropercolouringsofgraphswithboundedmaximumdegree AT kangr acyclicimpropercolouringsofgraphswithboundedmaximumdegree AT mcdiarmidc acyclicimpropercolouringsofgraphswithboundedmaximumdegree AT pinloua acyclicimpropercolouringsofgraphswithboundedmaximumdegree |