A CHARACTERIZATION OF BIPARTITE GRAPHS

Walter J. CORTEZ-MORALES[1]

§    ABSTRACT: In the literature by using the concept of a cycle and the vertex colouring has been characterized bipartite graphs. In this work we introduce the concept of hinge graphs, and this new notion is used to characterize complete bipartite graphs of order (X È Y) = n with 3£ ½ X½ £ ½ Y½ .

§    KEYWORDS: Hinge-graph; quasi-hinge; pin-vertex; fixed-vertex; complete bipartite; hinge-family.

 

 

 



[1]Departamento de Ciências da Computação e Estatística - Instituto de Biociências, Letras e Ciências Exatas - UNESP - 15054-000 São José do Rio Preto - SP - Brasil.