Mike Newman

Publications (3)0 Total impact

• Article: A note on packing spanning trees in graphs and bases in matroids

  Robert F. Bailey, Mike Newman, Brett Stevens
  [show abstract] [hide abstract]
  ABSTRACT: We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We provide descriptions of such graphs and matroids, showing that such a graph (or matroid) has a unique decomposition. In the case of graphs, our results are relevant for certain communication protocols.
  03/2012;
• Article: Vertex-colouring edge-weightings with two edge weights.

  Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens
  Discrete Mathematics & Theoretical Computer Science. 01/2012; 14:1-20.
• Source

  Available from: emis.de

  Article: Digraphs are 2-Weight Choosable.

  Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens
  Electr. J. Comb. 01/2011; 18.