The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Functigraphs: An extension of permutation graphs

Andrew ChenDaniela FerreroRalucca GeraEunjeong Yi — 2011

Mathematica Bohemica

Let G 1 and G 2 be copies of a graph G , and let f : V ( G 1 ) 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 ) V ( G 2 ) and E = E ( G 1 ) E ( G 2 ) { u v : u V ( G 1 ) , v V ( G 2 ) , v = f ( u ) } . In this paper, we study colorability and planarity of functigraphs.

Page 1

Download Results (CSV)