Functigraphs: An extension of permutation graphs

@article{Chen2011,
abstract = {Let $G_1$ and $G_2$ be copies of a graph $G$, and let $f\colon V(G_1) \rightarrow V(G_2)$ be a function. Then a functigraph $C(G, f)=(V, E)$ is a generalization of a permutation graph, where $V=V(G_1) \cup V(G_2)$ and $E=E(G_1) \cup E(G_2)\cup \lbrace uv \colon u \in V(G_1), v \in V(G_2),v=f(u)\rbrace $. In this paper, we study colorability and planarity of functigraphs.},
author = {Chen, Andrew, Ferrero, Daniela, Gera, Ralucca, Yi, Eunjeong},
journal = {Mathematica Bohemica},
keywords = {permutation graph; generalized Petersen graph; functigraph; permutation graph; generalized Petersen graph; functigraph},
language = {eng},
number = {1},
pages = {27-37},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Functigraphs: An extension of permutation graphs},
url = {http://eudml.org/doc/197079},
volume = {136},
year = {2011},
}

TY - JOUR
AU - Chen, Andrew
AU - Ferrero, Daniela
AU - Gera, Ralucca
AU - Yi, Eunjeong
TI - Functigraphs: An extension of permutation graphs
JO - Mathematica Bohemica
PY - 2011
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 136
IS - 1
SP - 27
EP - 37
AB - Let $G_1$ and $G_2$ be copies of a graph $G$, and let $f\colon V(G_1) \rightarrow V(G_2)$ be a function. Then a functigraph $C(G, f)=(V, E)$ is a generalization of a permutation graph, where $V=V(G_1) \cup V(G_2)$ and $E=E(G_1) \cup E(G_2)\cup \lbrace uv \colon u \in V(G_1), v \in V(G_2),v=f(u)\rbrace $. In this paper, we study colorability and planarity of functigraphs.
LA - eng
KW - permutation graph; generalized Petersen graph; functigraph; permutation graph; generalized Petersen graph; functigraph
UR - http://eudml.org/doc/197079
ER -