Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graph theory")

Filter

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

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 20592

  • Page / 824

Export

Selection :

  • and

Graph-theoretic connectivity measures: what do they tell us about connectivity?LAITA, A; KOTIAHO, J. S; MONKKONEN, M et al.Landscape ecology. 2011, Vol 26, Num 7, pp 951-967, issn 0921-2973, 17 p.Article

Domination in graphs with minimum degree twoMCCUAIG, W; SHEPHERD, B.Journal of graph theory. 1989, Vol 13, Num 6, pp 749-762, issn 0364-9024, 14 p.Article

The strong perfect graph conjecture for pan-free graphsOLARIU, S.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 2, pp 187-191, issn 0095-8956, 5 p.Article

Simple perfect squared squares and 2 × 1 squared rectangles of order 26DUIJVESTIJN, A. J. W.Mathematics of computation. 1996, Vol 65, Num 215, pp 1359-1364, issn 0025-5718Article

An Erdös-Gallai conjecturePYBER, L.Combinatorica (Print). 1985, Vol 5, Num 1, pp 67-79, issn 0209-9683Article

Reconstruction of hypertreesSENGE, H. G.Pacific journal of mathematics. 1985, Vol 118, Num 2, pp 565-574, issn 0030-8730Article

Dynamic reserve design with the union-find algorithmHARRISON, Paul; SPRING, Daniel; MACKENZIE, Michael et al.Ecological modelling. 2008, Vol 215, Num 4, pp 369-376, issn 0304-3800, 8 p.Article

Reducing Redundancies in Reconfigurable Antenna Structures Using Graph ModelsCOSTANTINE, Joseph; AL-SAFFAR, Sinan; CHRISTODOULOU, Christos G et al.IEEE transactions on antennas and propagation. 2011, Vol 59, Num 3, pp 793-801, issn 0018-926X, 9 p.Article

The Steinberg module of a graphGHINELLI, D; JUNGNICKEL, D.Archiv der Mathematik. 1990, Vol 55, Num 5, pp 503-506, issn 0003-889X, 4 p.Article

Forest patch connectivity diagnostics and prioritization using graph theorySHANTHALA DEVI, B. S; MURTHY, M. S. R; DEBNATH, Bijan et al.Ecological modelling. 2013, Vol 251, pp 279-287, issn 0304-3800, 9 p.Article

Graph theoretical duality perspective on conjugate structures and its applicationsTA'ASEH, N; SHAI, O.European journal of mechanics. A. Solids. 2005, Vol 24, Num 6, pp 974-986, issn 0997-7538, 13 p.Article

Quantifying landscape connectivity through the use of connectivity response curvesERNST, Bevan W.Landscape ecology. 2014, Vol 29, Num 6, pp 963-978, issn 0921-2973, 16 p.Article

Ecological models based on people's knowledge: a multi-step fuzzy cognitive mapping approachÖZESMI, Uygar; ÖZESMI, Stacy L.Ecological modelling. 2004, Vol 176, Num 1-2, pp 43-64, issn 0304-3800, 22 p.Article

6th International Conference on Graph TheoryFOUQUET, J.-L; RUSU, I.Discrete mathematics. 2004, Vol 276, Num 1-3, issn 0012-365X, 411 p.Conference Proceedings

Workshop on graph-based toolsMENS, Tom; SCHÜRR, Andy; TAENTZER, Gabriele et al.Lecture notes in computer science. 2002, pp 440-444, issn 0302-9743, isbn 3-540-44310-X, 5 p.Conference Paper

Recognition and orientation algorithms for P4-Comparability graphsNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2001, pp 320-331, issn 0302-9743, isbn 3-540-42985-9Conference Paper

Efficient and constructive algorithms for the pathwidth and treewidth of graphsBODLAENDER, H. L; KLOKS, T.Journal of algorithms (Print). 1996, Vol 21, Num 2, pp 358-402, issn 0196-6774Article

On the orderability problem for PLA foldingRAVI, S. S.Discrete applied mathematics. 1989, Vol 25, Num 3, pp 317-320, issn 0166-218X, 4 p.Article

Simple enumeration of minimal tiesets of undirected graphHASANUDDIN AHMAD, S.Microelectronics and reliability. 1989, Vol 29, Num 4, pp 509-510, issn 0026-2714, 2 p.Article

Association schemes of quadratic formsEGAWA, Y.Journal of combinatorial theory. Series A. 1985, Vol 38, Num 1, pp 1-14, issn 0097-3165Article

Graph theory and fluid dynamicsGUSTAFSON, K; HARTMAN, R.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 4, pp 643-656, issn 0196-5212Article

[a,b]-factorization of a graphKANO, M.Journal of graph theory. 1985, Vol 9, Num 1, pp 129-146, issn 0364-9024Article

Distance regular graphs of diameter 3 and strongly regular graphsBROUWER, A. E.Discrete mathematics. 1984, Vol 49, Num 1, pp 101-103, issn 0012-365XArticle

Embedding graphs in surfacesHOFFMAN, P; RICHTER, B.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 1, pp 65-84, issn 0095-8956Article

Infinite families of crossing-critical graphs with a given crossing numberSIRAN, J.Discrete mathematics. 1984, Vol 48, Num 1, pp 129-132, issn 0012-365XArticle

  • Page / 824