Sciweavers

SIAMDM
2008
84views more  SIAMDM 2008»
13 years 11 months ago
Long Local Searches for Maximal Bipartite Subgraphs
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
Hemanshu Kaul, Douglas B. West
ENDM
2007
140views more  ENDM 2007»
13 years 11 months ago
Acyclic dominating partitions
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
Louigi Addario-Berry, Ross J. Kang
DM
2010
143views more  DM 2010»
13 years 11 months ago
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 cl...
Louigi Addario-Berry, Louis Esperet, Ross J. Kang,...