AbstractA property of unimodularity is introduced for antisymmetric integral matrices. It is satisfied by the adjacency matrix of a circle graph provided with a Naji orientation [8]. In a further paper we shall interprete this result in terms of symmetric matroids introduced in [2]. In this communication we give a direct proof by means of techniques used in [1] for an algorithmic solution of the Gauss problem on self-intersecting surves in the plane
AbstractFor a nonempty and noncomplete circulant graph G on a prime number n of vertices with adjace...
AbstractThis paper is devoted to a simple alternative proof for a theorem of Frank and Tardos (Math....
AbstractA common framework for the two concepts of the title is developed to yield an alternative pr...
AbstractA property of unimodularity is introduced for antisymmetric integral matrices. It is satisfi...
AbstractLet G be a simple graph, and consider an orientation of the edges of G. Where V is the verte...
AbstractLet Q = Q>(G) be an oriented vertex-edge incidence matrix for the graph G. Then K(G) = QtQ i...
AbstractWe characterize skew-symmetric {1,0,−1}-matrices with a certain combinatorial property. In p...
AbstractWe give, in terms of totally unimodular matrices, a short and easy proof of Tutte's characte...
AbstractLet G be a graph with vertices 1, 2, …, n. Associated with G, there is an integral quadratic...
Interval graphs are intersection graphs of closed intervals and circle graphs are intersection graph...
AbstractWe present a class of graphs whose adjacency matrices are nonsingular with integral inverses...
Une suite à doubles occurrences est une suite de lettres, définie à une permutation circulaire pràs,...
Given a family of nonempty sets S = {Si}, the intersection graph of the family S is the graph with o...
AbstractA family of n×n symmetric circulant (0, 1) matrices is studied. It is shown that the determi...
Étant donnée une famille d’ensembles non vides S = {Si}, le graphe d’intersection de la famille S es...
AbstractFor a nonempty and noncomplete circulant graph G on a prime number n of vertices with adjace...
AbstractThis paper is devoted to a simple alternative proof for a theorem of Frank and Tardos (Math....
AbstractA common framework for the two concepts of the title is developed to yield an alternative pr...
AbstractA property of unimodularity is introduced for antisymmetric integral matrices. It is satisfi...
AbstractLet G be a simple graph, and consider an orientation of the edges of G. Where V is the verte...
AbstractLet Q = Q>(G) be an oriented vertex-edge incidence matrix for the graph G. Then K(G) = QtQ i...
AbstractWe characterize skew-symmetric {1,0,−1}-matrices with a certain combinatorial property. In p...
AbstractWe give, in terms of totally unimodular matrices, a short and easy proof of Tutte's characte...
AbstractLet G be a graph with vertices 1, 2, …, n. Associated with G, there is an integral quadratic...
Interval graphs are intersection graphs of closed intervals and circle graphs are intersection graph...
AbstractWe present a class of graphs whose adjacency matrices are nonsingular with integral inverses...
Une suite à doubles occurrences est une suite de lettres, définie à une permutation circulaire pràs,...
Given a family of nonempty sets S = {Si}, the intersection graph of the family S is the graph with o...
AbstractA family of n×n symmetric circulant (0, 1) matrices is studied. It is shown that the determi...
Étant donnée une famille d’ensembles non vides S = {Si}, le graphe d’intersection de la famille S es...
AbstractFor a nonempty and noncomplete circulant graph G on a prime number n of vertices with adjace...
AbstractThis paper is devoted to a simple alternative proof for a theorem of Frank and Tardos (Math....
AbstractA common framework for the two concepts of the title is developed to yield an alternative pr...