Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Grafo conexo")

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

Origin

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

Results 1 to 25 of 2232

  • Page / 90
Export

Selection :

  • and

Edge number of 3-connected diameter 3 graphsTSAI, Ming-Chun; FU, Hung-Lin.International Symposium on Parallel Architectures, Algorithms, and Networks. 2004, pp 364-367, isbn 0-7695-2135-5, 1Vol, 4 p.Conference Paper

On a simple depth-first search strategy for exploring unknown graphsKWEK, S.Lecture notes in computer science. 1997, pp 345-353, issn 0302-9743, isbn 3-540-63307-3Conference Paper

Intersection number of two connected geometric graphsTOKUNAGA, S.-I.Information processing letters. 1996, Vol 59, Num 6, pp 331-333, issn 0020-0190Article

Edge Number of 3-Connected Diameter 3 GraphsTSAI, Mine-Chun; FU, Hung-Lin.International Symposium on Parallel Architectures, Algorithms, and Networks. 2004, pp 364-367, isbn 0-7695-2135-5, 1Vol, 4 p.Conference Paper

The average connectivity of a graphBEINEKE, Lowell W; OELLERMANN, Ortrud R; PIPPERT, Raymond E et al.Discrete mathematics. 2002, Vol 252, Num 1-3, pp 31-45, issn 0012-365XArticle

A note on counting connected graph covering projectionsHOFMEISTER, M.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 2, pp 286-292, issn 0895-4801Article

Orthogonal drawing of high degree graphs with small area and few bendsPAPAKOSTAS, A; TOLLIS, I. G.Lecture notes in computer science. 1997, pp 354-367, issn 0302-9743, isbn 3-540-63307-3Conference Paper

Some notes on domination edge critical graphsNADER JAFARI RAD; SAYYED HEIDAR JAFARI.Comptes rendus. Mathématique. 2011, Vol 349, Num 9-10, pp 485-488, issn 1631-073X, 4 p.Article

On the spectral Ádám property for circulant graphsMANS, Bernard; PAPPALARDI, Francesco; SHPARLINSKI, Igor et al.Discrete mathematics. 2002, Vol 254, Num 1-3, pp 309-329, issn 0012-365XArticle

Linear algorithm for 3-coloring of locally connected graphsKOCHOL, Martin.Lecture notes in computer science. 2003, pp 191-194, issn 0302-9743, isbn 3-540-40205-5, 4 p.Conference Paper

Forbidden subgraphs and the existence of paths and cycles passing through specified verticesFUJISAWA, Jun; OTA, Katsuhiro; SUGIYAMA, Takeshi et al.Discrete mathematics. 2008, Vol 308, Num 24, pp 6111-6114, issn 0012-365X, 4 p.Article

Periodic graphs and connectivity of the rational digital hyperplanesGERARD, Yan.Theoretical computer science. 2002, Vol 283, Num 1, pp 171-182, issn 0304-3975Conference Paper

Cycles in the cube-connected cycles graphGERMA, A; HEYDEMANN, M.-C; SOTTEAU, D et al.Discrete applied mathematics. 1998, Vol 83, Num 1-3, pp 135-155, issn 0166-218XArticle

A construction of 3-connected graphsBARNETTE, D. W.Israel Journal of Mathematics. 1994, Vol 86, Num 1-3, pp 397-407, issn 0021-2172Article

Cubicity of threshold graphsADIGA, Abhijin.Discrete mathematics. 2009, Vol 309, Num 8, pp 2535-2537, issn 0012-365X, 3 p.Article

Geodetic sets and Steiner sets in graphsTONG, Li-Da.Discrete mathematics. 2009, Vol 309, Num 12, pp 4203-4205, issn 0012-365X, 3 p.Article

On the average Steiner distance of graphs with prescribed propertiesDANKELMANN, P; SWART, H. C; OELLERMANN, O. R et al.Discrete applied mathematics. 1997, Vol 79, Num 1-3, pp 91-103, issn 0166-218XArticle

k-edge connected polyhedra on series-parallel graphsDIDI BIHA, M; MAHJOUB, A. R.Operations research letters. 1996, Vol 19, Num 2, pp 71-78, issn 0167-6377Article

Some inequalities in distance-regular graphsNOMURA, K.Journal of combinatorial theory. Series B. 1993, Vol 58, Num 2, pp 243-247, issn 0095-8956Article

Computational FolkloristicsABELLO, James; BROADWELL, Peter; TANGHERLINI, Timothy R et al.Communications of the ACM. 2012, Vol 55, Num 7, pp 60-70, issn 0001-0782, 11 p.Article

On the minimum real roots of the adjoint polynomial of a graphHAIXING ZHAO; RUYING LIU.Discrete mathematics. 2009, Vol 309, Num 13, pp 4635-4641, issn 0012-365X, 7 p.Article

On the number of edges in graphs with a given weakly connected domination numberSANCHIS, Laura A.Discrete mathematics. 2002, Vol 257, Num 1, pp 111-124, issn 0012-365X, 14 p.Article

Disconnected graph layout and the polyomino packing approachFREIVALDS, Karlis; DOGRUSOZ, Ugur; KIKUSTS, Paulis et al.Lecture notes in computer science. 2002, pp 378-391, issn 0302-9743, isbn 3-540-43309-0Conference Paper

Calculating a relational program for transitive reductions of strongly connected graphsBERGHAMMER, Rudolf; HOFFMANN, Thorsten.Lecture notes in computer science. 2002, pp 258-275, issn 0302-9743, isbn 3-540-00315-0, 18 p.Conference Paper

A note on self-stabilizing articulation point detectionCHAUDHURI, P.Journal of systems architecture. 1999, Vol 45, Num 14, pp 1249-1252, issn 1383-7621Article

  • Page / 90