UP - logo
(UL)
  • Erratum to "Reduction of symmetric configurations ▫$n_3$▫" [Discrete Appl. Math. 99(1-3) (2000) 401 -411]
    Steffen, Eckhard ...
    In [H.-G. Carstens, T. Dinski, E. Steffen, Reduction of symmetric configurations $▫n_3$▫, Discrete Appl. Math. 99 (2000) 401-411] the authors claim that there exist a finite number of reductions such ... that every connected bicubic graph with girth ▫$\ge 6$▫ different from the Fano-Heawood graph ▫$F$▫ can be reduced to a smaller of the same kind, having two vertices less, and by iteration to ▫$F$▫. In this note, we define an additional necessary reduction, which is not listed in [H.-G. Carstens, T. Dinski, E. Steffen, Reduction of symmetric configurations ▫$n_3$▫, Discrete Appl. Math. 99 (2000) 401-411].
    Source: Discrete applied mathematics. - ISSN 0166-218X (Vol. 154, iss. 11, 2006, str. 1645-1646)
    Type of material - article, component part
    Publish date - 2006
    Language - english
    COBISS.SI-ID - 15405145

source: Discrete applied mathematics. - ISSN 0166-218X (Vol. 154, iss. 11, 2006, str. 1645-1646)

loading ...
loading ...
loading ...