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.

Displaying 941 – 960 of 1227

Showing per page

An attractive class of bipartite graphs

Rodica Boliac, Vadim Lozin (2001)

Discussiones Mathematicae Graph Theory

In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.

An elementary proof of a congruence by Skula and Granville

Romeo Meštrović (2012)

Archivum Mathematicum

Let p 5 be a prime, and let q p ( 2 ) : = ( 2 p - 1 - 1 ) / p be the Fermat quotient of p to base 2 . The following curious congruence was conjectured by L. Skula and proved by A. Granville q p ( 2 ) 2 - k = 1 p - 1 2 k k 2 ( mod p ) . In this note we establish the above congruence by entirely elementary number theory arguments.

An equivalence criterion for 3-manifolds.

M. R. Casali (1997)

Revista Matemática de la Universidad Complutense de Madrid

Within geometric topology of 3-manifolds (with or without boundary), a representation theory exists, which makes use of 4-coloured graphs. Aim of this paper is to translate the homeomorphism problem for the represented manifolds into an equivalence problem for 4-coloured graphs, by means of a finite number of graph-moves, called dipole moves. Moreover, interesting consequences are obtained, which are related with the same problem in the n-dimensional setting.

Currently displaying 941 – 960 of 1227