Eliminating internal behaviour in Petri netsWIMMEL, Harro.Lecture notes in computer science. 2004, pp 411-425, issn 0302-9743, isbn 3-540-22236-7, 15 p.Conference Paper

A survey: recent results, conjectures, and open problems in labeling graphsGALLIAN, J. A.Journal of graph theory. 1989, Vol 13, Num 4, pp 491-504, issn 0364-9024Article

Les hypercartes planaires sont des arbres très bien étiquetés = Planar hypermaps are well-labelled treesARQUES, D.Discrete mathematics. 1986, Vol 58, Num 1, pp 11-24, issn 0012-365XArticle

Isomorphic factorizations. VII: Regular graphs and tournamentsWORMALD, N. C.Journal of graph theory. 1984, Vol 8, Num 1, pp 117-122, issn 0364-9024Article

Fonctions de structure des graphes étiquetésKLIMOV, A. N.Avtomatika i telemehanika. 1984, Num 6, pp 165-168, issn 0005-2310Article

Automorphisms of random graphs with specified vertigesMCKAY, B. D; WORMALD, N. C.Combinatorica (Print). 1984, Vol 4, Num 4, pp 325-338, issn 0209-9683Article

Counting shanning trees in the graphs of Kleitman and Golden and a generalizationVOHRA, R; WASHINGTON, L.Journal of the Franklin Institute. 1984, Vol 318, Num 5, pp 349-355, issn 0016-0032Article

On labeled vertex-transitive digraphs with a prime number of verticesCHONG-YUN CHAO; WELLS, J. G.Discrete mathematics. 1983, Vol 46, Num 3, pp 311-315, issn 0012-365XArticle

On Σ and Σ' labelled graphsBEENA, S.Discrete mathematics. 2009, Vol 309, Num 6, pp 1783-1787, issn 0012-365X, 5 p.Article

Counting binary matrices with given row and column sumsJOHNSEN, B; STRAUME, E.Mathematics of computation. 1987, Vol 48, Num 178, pp 737-750, issn 0025-5718Article

The corali project: From conceptual graphs to conceptual graphs via labelled graphsCHEIN, M.Lecture notes in computer science. 1997, pp 65-79, issn 0302-9743, isbn 3-540-63308-1Conference Paper

Labelled graphs with small vertex degrees and P-recursivenessGOULDEN, I. P; JACKSON, D. M.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 1, pp 60-66, issn 0196-5212Article

Relabelling in graph transformationHABEL, Annegret; PLUMP, Detlef.Lecture notes in computer science. 2002, pp 135-147, issn 0302-9743, isbn 3-540-44310-X, 13 p.Conference Paper

Enumeration of cyclically 4-connected cubic graphsWORMALD, N. C.Journal of graph theory. 1985, Vol 9, Num 4, pp 563-573, issn 0364-9024Article

ENUMERATION OF SMOOTH LABELLED GRAPHSWRIGHT EM.1982; PROC. R. SOC. EDINB., SECT. A, MATH.; ISSN 0308-2105; GBR; DA. 1982; VOL. 91; NO 3-4; PP. 205-212; BIBL. 14 REF.Article

TWO SETS OF GRACEFUL GRAPHSDELORME C.1980; J. GRAPH THEORY; USA; DA. 1980; VOL. 4; NO 2; PP. 247-250; BIBL. 2 REF.Article

TRIANGLES IN LABELLED CUBIC GRAPHSWORMALD NC.1978; LECTURE NOTES MATH.; DEU; DA. 1978; NO 686; PP. 337-345; BIBL. 7 REF.Conference Paper

ON LINEARIZING GRAPHSWITT KU.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 32-41; BIBL. 9 REF.Conference Paper

THE EVOLUTION OF UNLABELLED GRAPHS.WRIGHT EM.1976; J. LONDON MATH. SOC.; G.B.; DA. 1976; VOL. 14; NO 3; PP. 554-558; BIBL. 9 REF.Article

A CONSTRUCTIVE PROOF OF TUCKER'S COMBINATIONAL LEMMAFREUND RM; TODD MJ.1981; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1981; VOL. 30; NO 3; PP. 321-325; BIBL. 10 REF.Article

THE GRAPHS WITH ONLY SELF-DUAL SIGNINGSHARARY F; KOMMEL HJ.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 26; NO 3; PP. 235-241; BIBL. 6 REF.Article

Degree complete graphsJIANGUO QIAN.Discrete mathematics. 2006, Vol 306, Num 5, pp 533-537, issn 0012-365X, 5 p.Article

Planar separatorsALON, N; SEYMOUR, P; THOMAS, R et al.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 184-193, issn 0895-4801Article

Cycles through specified verticesBOLLOBAS, B; BRIGHTWELL, G.Combinatorica (Print). 1993, Vol 13, Num 2, pp 147-155, issn 0209-9683Article

On the number of labeled acyclic digraphsRODIONOV, V. I.Discrete mathematics. 1992, Vol 105, Num 1-3, pp 319-321, issn 0012-365XArticle