Functigraphs: An extension of permutation graphs Academic Article uri icon

abstract

  • Let G1 and G2 be copies of a graph G, and let f:V (G1) V (G2) be a function. Then a functigraph C(G, f) = (V,E) is a generalization of a permutation graph, where V = V (G1) {n-ary union} V (G2) and E = E(G1) {n-ary union} E(G2) {n-ary union} {uv:u V (G1), v V (G2), v = f(u)}. In this paper, we study colorability and planarity of functigraphs.

published proceedings

  • Mathematica Bohemica

author list (cited authors)

  • Chen, A., Ferrero, D., Gera, R., & Yi, E.

citation count

  • 6

complete list of authors

  • Chen, Andrew||Ferrero, Daniela||Gera, Ralucca||Yi, Eunjeong

publication date

  • June 2011