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
AbstractA circle graph is an intersection graph of a non-empty finite set of chords of a circle. By ...
AbstractLet G be a graph with vertices 1, 2, …, n. Associated with G, there is an integral quadratic...
In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where e...
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...
AbstractWe study graphs whose adjacency matrices have determinant equal to 1 or −1, and characterize...
We characterize the class of integral square matrices M having the property that for every integral ...
In this thesis we discuss possible generalizations of totally unimodular and network matrices. Our p...
AbstractLet Q = Q>(G) be an oriented vertex-edge incidence matrix for the graph G. Then K(G) = QtQ i...
We give, in terms of totally unimodular matrices, a short and easy proof of Tutte's characterization...
We characterize the symmetric (0, 1)-matrices that can be signed symmetrically so that every princip...
We present a polynomial time algorithm to construct a bidirected graph for any totally unimodular ma...
AbstractWe give, in terms of totally unimodular matrices, a short and easy proof of Tutte's characte...
In this appendix we provide a fuller self-contained proof of Theorems 1 and 11. Since Theorem 1 is a...
AbstractThe present publication is mainly a survey paper on the author's contributions on the relati...
AbstractA circle graph is an intersection graph of a non-empty finite set of chords of a circle. By ...
AbstractLet G be a graph with vertices 1, 2, …, n. Associated with G, there is an integral quadratic...
In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where e...
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...
AbstractWe study graphs whose adjacency matrices have determinant equal to 1 or −1, and characterize...
We characterize the class of integral square matrices M having the property that for every integral ...
In this thesis we discuss possible generalizations of totally unimodular and network matrices. Our p...
AbstractLet Q = Q>(G) be an oriented vertex-edge incidence matrix for the graph G. Then K(G) = QtQ i...
We give, in terms of totally unimodular matrices, a short and easy proof of Tutte's characterization...
We characterize the symmetric (0, 1)-matrices that can be signed symmetrically so that every princip...
We present a polynomial time algorithm to construct a bidirected graph for any totally unimodular ma...
AbstractWe give, in terms of totally unimodular matrices, a short and easy proof of Tutte's characte...
In this appendix we provide a fuller self-contained proof of Theorems 1 and 11. Since Theorem 1 is a...
AbstractThe present publication is mainly a survey paper on the author's contributions on the relati...
AbstractA circle graph is an intersection graph of a non-empty finite set of chords of a circle. By ...
AbstractLet G be a graph with vertices 1, 2, …, n. Associated with G, there is an integral quadratic...
In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where e...