Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Vértice grafo")

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 1258

  • Page / 51

Export

Selection :

  • and

Planar Crossing Numbers of Genus g GraphsDJIDJEV, Hristo; VRT'O, Imrich.Lecture notes in computer science. 2006, pp 419-430, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Extremal configurations and levels in pseudoline arrangementsSHARIR, Micha; SMORODINSKY, Shakhar.Lecture notes in computer science. 2003, pp 127-139, issn 0302-9743, isbn 3-540-40545-3, 13 p.Conference Paper

(g, f)-Factorizations orthogonal to k subgraphsHAODI FENG.Lecture notes in computer science. 2001, pp 129-139, issn 0302-9743, isbn 3-540-42707-4Conference Paper

Distance-related invariants on polygraphsJUVAN, M; MOHAR, B; ZEROVNIK, J et al.Discrete applied mathematics. 1997, Vol 80, Num 1, pp 57-71, issn 0166-218XArticle

On eccentric vertices in graphsCHARTRAND, G; SCHULTZ, M; WINTERS, S. J et al.Networks (New York, NY). 1996, Vol 28, Num 4, pp 181-186, issn 0028-3045Article

An O(|V|*|E|) algorithm for finding immediate multiple-vertex dominatorsALSTRUP, S; CLAUSEN, J; JØRGENSEN, K et al.Information processing letters. 1996, Vol 59, Num 1, pp 9-11, issn 0020-0190Article

Niche number fourGEHRLEIN, W. V; FISHBURN, P.Computers & mathematics with applications (1987). 1996, Vol 32, Num 9, pp 51-54, issn 0898-1221Article

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

Finding a minimum feedback vertex set in time o(1.7548n)FOMIN, Fedor V; GASPERS, Serge; PYATKIN, Artem V et al.Lecture notes in computer science. 2006, pp 184-191, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 8 p.Conference Paper

On rectilinear duals for vertex-weighted plane graphsDE BERG, Mark; MUMFORD, Elena; SPECKMANN, Bettina et al.Lecture notes in computer science. 2006, Vol 3843, pp 61-72, issn 0302-9743, isbn 3-540-31425-3, 1Vol, 12 p.Conference Paper

Sparse geometric graphs with small dilationARONOV, Boris; DE BERG, Mark; CHEONG, Otfried et al.Lecture notes in computer science. 2005, pp 50-59, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Untangling a polygonPACH, Janos; TARDOS, Gabor.Lecture notes in computer science. 2002, pp 154-161, issn 0302-9743, isbn 3-540-43309-0Conference Paper

Edge crossings in layered drawings of graphsEADES, P.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 47-50, issn 0044-2267, SUP3Conference Paper

Standard graphs in lens spacesWU, Ying-Qing.Pacific journal of mathematics. 2005, Vol 220, Num 2, pp 389-397, issn 0030-8730, 9 p.Article

An algorithm for cyclic edge connectivity of cubic graphs: (Extended abstract)DVORAK, Zdenek; KARA, Jan; KRAL, Daniel et al.Lecture notes in computer science. 2004, pp 236-247, issn 0302-9743, isbn 3-540-22339-8, 12 p.Conference Paper

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

Parameterized algorithms for feedback vertex setKANJ, Iyad; PELSMAJER, Michael; SCHAEFER, Marcus et al.Lecture notes in computer science. 2004, pp 235-247, issn 0302-9743, isbn 3-540-23071-8, 13 p.Conference Paper

On relationships between vertex-degrees, path-numbers and graph valence-shells in treesLUKOVITS, Istvan; NIKOLIC, Sonja; TRINAJSTIC, Nenad et al.Chemical physics letters. 2002, Vol 354, Num 5-6, pp 417-422, issn 0009-2614Article

A note on the irredundance number after vertex deletionFAVARON, O.Discrete mathematics. 1993, Vol 121, Num 1-3, pp 51-54, issn 0012-365XConference Paper

An improved fixed-parameter algorithm for vertex coverBALASUBRAMANIAN, R; FELLOWS, M. R; RAMAN, V et al.Information processing letters. 1998, Vol 65, Num 3, pp 163-168, issn 0020-0190Article

Size bounds for dynamic monopoliesPELEG, D.Discrete applied mathematics. 1998, Vol 86, Num 2-3, pp 263-273, issn 0166-218XArticle

Meyniel weakly triangulated graphs. II: A theorem of DiracHAYWARD, R. B.Discrete applied mathematics. 1997, Vol 78, Num 1-3, pp 283-289, issn 0166-218XArticle

The k-ball l-path branch weight centroidREID, K. B.Discrete applied mathematics. 1997, Vol 80, Num 2-3, pp 239-246, issn 0166-218XArticle

T-choosability in graphsALONA, N; ZAKS, A.Discrete applied mathematics. 1998, Vol 82, Num 1-3, pp 1-13, issn 0166-218XArticle

Diameters of uniform subset graphsYONGZHU CHEN; WEIFAN WANG.Discrete mathematics. 2008, Vol 308, Num 24, pp 6645-6649, issn 0012-365X, 5 p.Article

  • Page / 51