A Unified Approach to Visibility Representations of Planar Graphs.
R. Tamassia, Ioannis G. Tollis (1986)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Infinite Root Systems, Representations of Graphs and Invariant Theory.”
A Unified Approach to Visibility Representations of Planar Graphs.
Determining representations from invariant dimensions.
M. Larsen, R. Pink (1990)
Inventiones mathematicae
Similarity:
Computational construction of -graphs of Hecke algebras for up to 15.
Ochiai, Mitsuyuki, Kako, Fujio (1995)
Experimental Mathematics
Similarity:
On a Construction of Representations and a Problem of Enright.
Vinay V. Deodhar (1980)
Inventiones mathematicae
Similarity:
A Generalized Direct Product Of Graphs
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
A note on intersecting graphs.
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
'3in1' enhanced: three squared ways to '3in1' GRAPHS
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Analysis in matrix space and Speh's representations.
Siddhartha Sahi, Elias M. Stein (1990)
Inventiones mathematicae
Similarity:
Chord graphs - new means for representing graphs
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
Automata-based Representations for Infinite Graphs
Salvatore La Torre, Margherita Napoli (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns...