Acyclic improper colourings of graphs with bounded maximum degree

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...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Addario-Berry, L, Esperet, L, Kang, R, McDiarmid, C, Pinlou, A
Formáid:	Journal article
Teanga:	English
Foilsithe / Cruthaithe:	2010

Míreanna comhchosúla

Acyclic colourings of graphs with bounded degree
de réir: Mieczyslaw Borowiecki, et al.
Foilsithe / Cruthaithe: (2010-01-01)

The t-Improper Chromatic Number of Random Graphs
de réir: Kang, R, et al.
Foilsithe / Cruthaithe: (2010)

The t-improper chromatic number of random graphs
de réir: Kang, R, et al.
Foilsithe / Cruthaithe: (2008)

Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree
de réir: Fiedorowicz Anna
Foilsithe / Cruthaithe: (2013-03-01)

Colour degree matrices of graphs with at most one cycle
de réir: Hillebrand, A, et al.
Foilsithe / Cruthaithe: (2015)

On the Maximum Degree of a Random Planar Graph.
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2008)

Upper bounds on the non-3-colourability threshold of random graphs.
de réir: Fountoulakis, N, et al.
Foilsithe / Cruthaithe: (2002)

Improper colourings of graphs
de réir: Kang, R
Foilsithe / Cruthaithe: (2008)

Upper bounds on the non-3-colourability threshold of random graphs
de réir: Nikolaos Fountoulakis, et al.
Foilsithe / Cruthaithe: (2002-01-01)

Upper bounds on the non- 3-colourability threshold of random graphs
de réir: Nikolaos Fountoulakis, et al.
Foilsithe / Cruthaithe: (2002-12-01)

Acyclic Coloring of Graphs of Maximum Degree $\Delta$
de réir: Guillaume Fertin, et al.
Foilsithe / Cruthaithe: (2005-01-01)

On the spread of random graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2014)

On the spread of random graphs
de réir: Addario-Berry, L, et al.
Foilsithe / Cruthaithe: (2009)

Colouring proximity graphs in the plane
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (1999)

Vertex-Colouring Edge-Weightings.
de réir: Addario-Berry, L, et al.
Foilsithe / Cruthaithe: (2007)

Improper colouring of (random) unit disk graphs
de réir: Ross J. Kang, et al.
Foilsithe / Cruthaithe: (2005-01-01)

Negative results on acyclic improper colorings
de réir: Pascal Ochem
Foilsithe / Cruthaithe: (2005-01-01)

Colouring random geometric graphs
de réir: Colin J. H. McDiarmid, et al.
Foilsithe / Cruthaithe: (2005-01-01)

Channel assignment on graphs of bounded treewidth.
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2003)

Clique colouring of binomial random graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2018)

Independent sets in graphs with given minimum degree
de réir: Law, H, et al.
Foilsithe / Cruthaithe: (2012)

Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2001)

List Colouring Squares of Planar Graphs
de réir: Havet, F, et al.
Foilsithe / Cruthaithe: (2008)

Acyclic, Star and Oriented Colourings of Graph Subdivisions
de réir: David R. Wood
Foilsithe / Cruthaithe: (2005-01-01)

Acyclic, Star and Oriented Colourings of Graph Subdivisions
de réir: David R. Wood
Foilsithe / Cruthaithe: (2005-12-01)

Hypergraph colouring and the Lovász Local Lemma
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (1997)

Acyclic sum-list-colouring of grids and other classes of graphs
de réir: Ewa Drgas-Burchardt, et al.
Foilsithe / Cruthaithe: (2017-01-01)

Reducing the maximum degree of a graph: comparisons of bounds
de réir: Peter Borg
Foilsithe / Cruthaithe: (2021-04-01)

Connectivity for bridge-addable monotone graph classes
de réir: Berry, L, et al.
Foilsithe / Cruthaithe: (2011)

Random graphs on surfaces.
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2008)

On the span in channel assignment problems: Bounds, computing and counting
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2003)

On the span in channel assignment problems: bounds, computing and counting
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2003)

On the Complexity of Computing a Maximum Acyclic Matching in Undirected Graphs
de réir: Samer Nofal
Foilsithe / Cruthaithe: (2025-03-01)

Graph Imperfection.
de réir: Gerke, S, et al.
Foilsithe / Cruthaithe: (2001)

Connectivity for bridge-alterable graph classes
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2013)

On graphs with few disjoint t-star minors.
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2011)

The number of disk graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2014)

The number of disk graphs.
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2014)

Graph Imperfection II.
de réir: Gerke, S, et al.
Foilsithe / Cruthaithe: (2001)

Counting disk graphs.
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2011)