rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: On assembly of four-connected graphs
    part number: I
    part name: Minimal four- connected graphs
  name:
    name part: Chen, Jianer.
    role:
      role term: creator
  name:
    name part: Kanevsky, Arkady
    name part: 1961-
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: txu
    date issued: 1992
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: 26 leaves : illustrations ; 28 cm.
  abstract: Abstract: "A pseudo-subgraph of a graph G is a special minor of G with restricted edge contractions allowed. In this first paper of a series, it is shown that every 4-connected graph contains a pseudo-subgraph that is either the complete graph K₅ or the double-axle wheel W²₄ on four vertices. This result establishes the foundation for a structural theorem and efficient algorithms for 4-connected graphs that will appear in the subsequent papers in the series."
  note: Jianer Chen, Arkady Kanevsky.
  note: "August 1992."
  note: Includes bibliographical references.
  note: Supported in part by NSF. CCR-9110824
  note: Supported in part by Texas A&M TEES Excellence grant
  note: Supported in part by NATO International Scientific Exchange Program. CRG No. 911016
  subject:
    topic: Graph theory
  related item:
    title info:
      title: Technical report (Texas A & M University. Computer Science Department) ; 92-019
  record info:
    record content source: PMC
    record creation date: 931103
    record change date: 20151003082627.0
    record identifier: in00001255097