Title of article
Coding Properties of Breadth-First Search Orderings
Author/Authors
Ossona de Mendez، نويسنده , , P. and Rosenstiehl، نويسنده , , P.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
3
From page
253
To page
255
Abstract
Though it is known for long that there is as many pointed maps with m edges as connected involutions on {1,…, 2m + 2}, no actual bijection were known between these combinatorial objects. Such a bijection is described here as two reciprocal constructions: a map encoding and a map construction. These constructions appear to be simply derived from the properties of breadth-first search orderings.
Keywords
Connected involution , Breadth-First Search (BFS) , Double occurrence sequence , Graph drawing 1991 MSC: 05C30 , Combinatorial bijection , 05A05 , CODE , MAP
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2000
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452880
Link To Document