View Related Documents

Abstract

We give a characterization of DFS-cotree critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE1.

Fulltext Preview

Image of the first page of the fulltext document