Building syntax graphs from syntax equations: a case study in modular programmingCROOKES, D; FEE, R; PICKERING, V et al.Software, practice & experience. 1983, Vol 13, Num 12, pp 1129-1139, issn 0038-0644Article

IRREDUCIBLE GRAPHS. IIMILGRAM M.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 1; PP. 7-45; BIBL. 12 REF.Serial Issue

Implicit representation of graphsKANNAN, S; NAOR, M; RUDICH, S et al.SIAM journal on discrete mathematics (Print). 1992, Vol 5, Num 4, pp 596-603, issn 0895-4801Article

Strong graph representations for linear time-varying systemsFEINTUCH, A.Linear algebra and its applications. 1994, Vol 203-04, pp 385-399, issn 0024-3795Article

On polar visibility representations of graphsHUTCHINSON, Joan P.Lecture notes in computer science. 2002, pp 422-434, issn 0302-9743, isbn 3-540-43309-0Conference Paper

Normal forms for binary relationsDOUGHENY, Daniel J; GUTIERREZ, Claudio.Theoretical computer science. 2006, Vol 360, Num 1-3, pp 228-246, issn 0304-3975, 19 p.Article

Action graphs and coveringsMALNIC, Aleksander.Discrete mathematics. 2002, Vol 244, Num 1-3, pp 299-322, issn 0012-365XConference Paper

Query efficient implementation of graphs of bounded clique-widthCOURCELLE, B; VANICAT, R.Discrete applied mathematics. 2003, Vol 131, Num 1, pp 129-150, issn 0166-218X, 22 p.Conference Paper

Structures de tétraédrisation. Approches mathématique et algorithmique = Structure of tetrahedrization. A mathematical and algorithmical point of viewDarmet, Agnès; Fonlupt, Jean.1992, 113 p.Thesis

Automata-based representations for infinite graphsLA TORRE, Salvatore; NAPOLI, Margherita.Theoretical informatics and applications. 2001, Vol 35, Num 4, pp 311-330Article

A geometrical characterization of strongly regular graphsNOZAKI, Hiroshi; SHINOHARA, Masashi.Linear algebra and its applications. 2012, Vol 437, Num 10, pp 2587-2600, issn 0024-3795, 14 p.Article

Minimal Euclidean representations of graphsROY, Aidan.Discrete mathematics. 2010, Vol 310, Num 4, pp 727-733, issn 0012-365X, 7 p.Article