Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graphe marqué")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 209

  • Page / 9
Export

Selection :

  • and

Skolem labelled graphsMENDELSOHN, E; SHALABY, N.Discrete mathematics. 1991, Vol 97, Num 1-3, pp 301-317, issn 0012-365XArticle

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

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

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

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

Circular permutation graph family with applications : Discrete algorithms and complexityLOU, R. D; SARRAFZADEH, M.Discrete applied mathematics. 1992, Vol 40, Num 3, pp 433-457, issn 0166-218XArticle

Asymptotic enumeration by degree sequence of graphs with degrees o(n1/2)MCKAY, B. D; WORMALD, N. C.Combinatorica (Print). 1991, Vol 11, Num 4, pp 369-382, issn 0209-9683Article

Using composite low rank and sparse graph for label propagationJUNJUN GUO; DAIWEN WU.Electronics letters. 2014, Vol 50, Num 2, pp 84-86, issn 0013-5194, 3 p.Article

On the clique-width of graphs in hereditary classesBOLIAC, Rodica; LOZIN, Vadim.Lecture notes in computer science. 2002, pp 44-54, issn 0302-9743, isbn 3-540-00142-5, 11 p.Conference Paper

Labelling recursive auto-associative memorySPERDUTI, A.Connection science (Print). 1994, Vol 6, Num 4, pp 429-459, issn 0954-0091Article

Orientation embedding of signed graphsZASLAVSKY, T.Journal of graph theory. 1992, Vol 16, Num 5, pp 399-422, issn 0364-9024Article

Enumeration of difference graphsPELED, U. N; SUN, F.Discrete applied mathematics. 1995, Vol 60, Num 1-3, pp 311-318, issn 0166-218XArticle

Enumeration of acyclic walks in a graphBABIC, D; GRAOVAC, A.Discrete applied mathematics. 1993, Vol 45, Num 2, pp 117-123, issn 0166-218XArticle

An enumerating function for spanning forests with color restrictionsBAPAT, R. B; CONSTANTINE, G.Linear algebra and its applications. 1992, Vol 173, pp 231-237, issn 0024-3795Article

On some partial line graphs of a hypergraph and the associated matroidJEGOU, P; VILAREM, M.-C.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 333-344, issn 0012-365XConference Paper

COUNTING BALANCED SIGNED GRAPHS USING MARKED GRAPHSHARARY F; KABELL JA.1981; PROC. EDINB. MATH. SOC.; ISSN 0013-0915; GBR; DA. 1981; VOL. 24; NO 2; PP. 99-104; BIBL. 7 REF.Article

On the enumeration of parking functions by leading termsEU, Sen-Peng; FU, Tung-Shan; LAI, Chun-Ju et al.Advances in applied mathematics (Print). 2005, Vol 35, Num 4, pp 392-406, issn 0196-8858, 15 p.Article

Counting claw-free cubic graphsPALMER, Edgar M; READ, Ronald C; ROBINSON, Robert W et al.SIAM journal on discrete mathematics (Print). 2003, Vol 16, Num 1, pp 65-73, issn 0895-4801, 9 p.Article

The power of a pebble: Exploring and mapping directed graphsBENDER, Michael A; FERNANDEZ, Antonio; RON, Dana et al.Information and computation (Print). 2002, Vol 176, Num 1, pp 1-21, issn 0890-5401Article

A characterization of families of graphs in which election is possibleGODARD, Emmanuel; METIVIER, Yves.Lecture notes in computer science. 2002, pp 159-171, issn 0302-9743, isbn 3-540-43366-XConference Paper

Labeling heuristics for orthogonal drawingsBINUCCI, Carla; DIDIMO, Walter; LIOTTA, Giuseppe et al.Lecture notes in computer science. 2002, pp 139-153, issn 0302-9743, isbn 3-540-43309-0Conference Paper

Drawing graphs symmetrically in three dimensionsHONG, Seok-Hee.Lecture notes in computer science. 2002, pp 189-204, issn 0302-9743, isbn 3-540-43309-0Conference Paper

Query optimization for semistructured data using path constraints in a deterministic data modelBUNEMAN, Peter; WENFEI FAN; WEINSTEIN, Scott et al.Lecture notes in computer science. 2000, pp 208-223, issn 0302-9743, isbn 3-540-41481-9Conference Paper

  • Page / 9