Graph Imperfection II.

Graph Imperfection II.

The imperfection ratio is a graph invariant which indicates how good a lower bound the weighted clique number gives on the weighted chromatic number, in the limit as weights get large. Its introduction was motivated by investigations of the radio channel assignment problem, where one has to assign c...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Gerke, S, McDiarmid, C
Formáid:	Journal article
Teanga:	English
Foilsithe / Cruthaithe:	Elsevier 2001

Míreanna comhchosúla

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

Graph Imperfection with a Co-Site Constraint.
de réir: Gerke, S, et al.
Foilsithe / Cruthaithe: (2004)

On the Number of Edges in Random Planar Graphs.
de réir: Gerke, S, et al.
Foilsithe / Cruthaithe: (2004)

Random planar graphs with n nodes and a fixed number of edges.
de réir: Gerke, S, et al.
Foilsithe / Cruthaithe: (2005)

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

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

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

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

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

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

Channel Assignment with Large Demands.
de réir: Gerke, S, et al.
Foilsithe / Cruthaithe: (2001)

Random Graphs from a Minor-Closed Class.
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2009)

On the divisibility of graphs
de réir: Hoang, C, et al.
Foilsithe / Cruthaithe: (2002)

Random graphs from a weighted minor-closed class
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2012)

On the chromatic number of random geometric graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2011)

Integer realizations of disk and segment graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2011)

Integer realizations of disk and segment graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2011)

On the chromatic number of random geometric graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2011)

Connectivity for random graphs from a weighted bridge-addable class
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2012)

Random perfect graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2018)

Bisecting sparse random graphs.
de réir: Luczak, M, et al.
Foilsithe / Cruthaithe: (2001)

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

Modularity of regular and treelike graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2017)

Edge-maximal graphs on surfaces
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2017)

The Number of Bits Needed to Represent a Unit Disk Graph.
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2010)

Random graphs with few disjoint cycles
de réir: Kurauskas, V, et al.
Foilsithe / Cruthaithe: (2010)

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

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

Modularity in random regular graphs and lattices.
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2013)

Recognition of unipolar and generalised split graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2015)

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

On the purity of minor-closed classes of graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2018)

Modularity of Erdos-Rényi random graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2018)

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

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)

Random unlabelled graphs containing few disjoint cycles.
de réir: Kang, M, et al.
Foilsithe / Cruthaithe: (2011)

Random graphs from a block-stable class
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2016)

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

Random Graphs Containing Few Disjoint Excluded Minors
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2014)