Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Vertex(graph)")

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 1618

  • Page / 65

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

Reconstruction from vertex-switchingSTANLEY, R. P.Journal of combinatorial theory. Series B. 1985, Vol 38, Num 2, pp 132-138, issn 0095-8956Article

Graphs with three mutually pseudo-similar verticesGODSIL, C. D; KOCAY, W. L.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 3, pp 240-246, issn 0095-8956Article

An upper bound for the k-domination number of a graphCOCKAYNE, E. J; GAMBLE, B; SHEPHERD, B et al.Journal of graph theory. 1985, Vol 9, Num 4, pp 533-534, issn 0364-9024Article

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

On the complexity of partitioning graphs into connected subgraphsDYER, M. E; FRIEZE, A. M.Discrete applied mathematics. 1985, Vol 10, Num 2, pp 139-153, issn 0166-218XArticle

On the number of vertices of given degree in a random graphPALKA, Z.Journal of graph theory. 1984, Vol 8, Num 1, pp 167-170, issn 0364-9024Article

The chromatic polynomial of a graphLEHMER, D. H.Pacific journal of mathematics. 1985, Vol 118, Num 2, pp 463-469, issn 0030-8730Article

The generating function of whitworth runsLIU, C. J.Discrete mathematics. 1984, Vol 51, Num 3, pp 221-228, issn 0012-365XArticle

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

Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valencyCOWEN, L. J; COWEN, R. H; WOODALL, D. R et al.Journal of graph theory. 1986, Vol 10, Num 2, pp 187-195, issn 0364-9024Article

Domination parameters for the bishops graphCOCKAYNE, E. J; GAMBLE, B; SHEPHERD, B et al.Discrete mathematics. 1986, Vol 58, Num 3, pp 221-227, issn 0012-365XArticle

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

On the chromatic number of the product of graphsDUFFUS, D; SANDS, B; WOODROW, R. E et al.Journal of graph theory. 1985, Vol 9, Num 4, pp 487-495, issn 0364-9024Article

On approximation problems related to the independent set and vertex cover problemsBAR-YEHUDA, R; MORAN, S.Discrete applied mathematics. 1984, Vol 9, Num 1, pp 1-10, issn 0166-218XArticle

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

A simple proof of the Erdos-Gallai theorem on graph sequencesCHOUDUM, S. A.Bulletin of the Australian Mathematical Society. 1986, Vol 33, Num 1, pp 67-70, issn 0004-9727Article

On the degrees of vertices in locally finite graphs which possess a certain edge deletion propertyANDREAE, T.Archiv der Mathematik. 1985, Vol 45, Num 6, pp 574-576, issn 0003-889XArticle

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

  • Page / 65