@inproceedings{324169ebf2664994a36b18e3c6aa93bb,

title = "On generation of a class of flowgraphs",

abstract = "We present some structure theorems for the class of binary flowgraphs. These graphs show up in the study of the structural complexity of flowcharts. A binary flowgraph is a digraph with distinct vertices s and t such that (1) t is a sink, (2) all vertices other than t have outdegree 2 and (3) for every vertex v there is a path from s to v, and a path from v to t. An irreducible flowgraph (IBF) is a binary flowgraph with no proper subgraph that is a binary flowgraph. We define a simple operation called generation that produces an IBF on k vertices from one on k - 1 vertices. Our main result is that all IBF's can be obtained from an IBF on two vertices by a sequence of generation operations. In some cases the last generation step is uniquely defined and we give some additional results on this matter.",

author = "Hurkens, {A. J.C.} and Hurkens, {C. A.J.} and Whitty, {R. W.}",

year = "1992",

doi = "10.1016/S0167-5060(08)70613-7",

language = "English",

isbn = "0-444-89543-4",

series = "Annals of Discrete Mathematics",

publisher = "North-Holland Publishing Company",

pages = "107--112",

editor = "J. Nesetril and M. Fiedler",

booktitle = "Combinatorics, graphs and complexity (Proceedings 4th Czechoslovakian Symposium, Prachatice, Czechoslovakia, 1990)",

address = "Netherlands",

}