---
res:
  bibo_abstract:
  - "An $r$-graph is an $r$-regular graph where every odd set of vertices is\r\nconnected
    by at least $r$ edges to the rest of the graph. Seymour conjectured\r\nthat any
    $r$-graph is $r+1$-edge-colorable, and also that any $r$-graph\r\ncontains $2r$
    perfect matchings such that each edge belongs to two of them. We\r\nshow that
    the minimum counter-example to either of these conjectures is a\r\nbrick. Furthermore
    we disprove a variant of a conjecture of Fan, Raspaud.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Vahan
      foaf_name: Mkrtchyan, Vahan
      foaf_surname: Mkrtchyan
  - foaf_Person:
      foaf_givenName: Eckhard
      foaf_name: Steffen, Eckhard
      foaf_surname: Steffen
      foaf_workInfoHomepage: http://www.librecat.org/personId=15548
  dct_date: 2010^xs_gYear
  dct_language: eng
  dct_title: Bricks and conjectures of Berge, Fulkerson and Seymour@
...