Now showing items 1-3 of 3

• #### Bijections for Baxter families and related objects ﻿

(2011-04)
Article
Open Access
The Baxter number can be written as $B_n = \sum_0^n \Theta_{k,n-k-1}$. These numbers have first appeared in the enumeration of so-called Baxter permutations; $B_n$ is the number of Baxter permutations of size $n$, and ...
• #### Binary labelings for plane quadrangulations and their relatives ﻿

(2010)
Article
Open Access
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two ...
• #### Recoloring directed graphs ﻿

(Prensas Universitarias de Zaragoza, 2009)
Conference report
Open Access
Let G be a directed graph and k a positive integer. We define the k-color graph of G (Dk(G) for short) as the directed graph having all k-colorings of G as node set, and where two k-colorings and ' are joined by a ...