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

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 P₄-Comparability graphsNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2001, pp 320-331, issn 0302-9743, isbn 3-540-42985-9Conference Paper

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

Parameterized graph separation problemsMARX, Daniel.Lecture notes in computer science. 2004, pp 71-82, issn 0302-9743, isbn 3-540-23071-8, 12 p.Conference Paper

Graph theoretic models for reasoning about timeGOLUMBIC, Martin Charles.Lecture notes in computer science. 2004, pp 352-362, issn 0302-9743, isbn 3-540-24087-X, 11 p.Conference Paper

WG 2004 : graph-theoretic concepts in computer science (Bad Honnef, 21-23 June 2004, revised papers)Hromkovic, Juraj; Nagl, Manfred; Westfechtel, Bernhard et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-24132-9, XI, 404 p, isbn 3-540-24132-9Conference Proceedings

Constant time generation of trees with specified diameterNAKANO, Shin-Ichi; UNO, Takeaki.Lecture notes in computer science. 2004, pp 33-45, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Interlace polynomialsAIGNER, Martin; VAN DER HOLST, Hein.Linear algebra and its applications. 2004, Vol 377, pp 11-30, issn 0024-3795, 20 p.Article

Special Section on GraBaTs 2008International journal on software tools for technology transfer (Print). 2010, Vol 12, Num 3-4, issn 1433-2779, 135 p.Conference Proceedings

WG 2002 : graph-theoretic concepts in computer science (Cesky Krumlov, 13-15 June 2002, revised papers)Kucera, Ludek.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-00331-2, XI, 420 p, isbn 3-540-00331-2Conference Proceedings

Special issue devoted to papers presented at the Aveiro Workshop on Graph SpectraCVETKOVIC, D; HAEMERS, W; ROWLINSON, P et al.Linear algebra and its applications. 2007, Vol 423, Num 1, issn 0024-3795, 184 p.Conference Proceedings

Enumerating Non-crossing Minimally Rigid FrameworksAVIS, David; KATOH, Naoki; OHSAKI, Makoto et al.Lecture notes in computer science. 2006, pp 205-215, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 11 p.Conference Paper

Ecological subsystems via graph theory : the role of strongly connected componentsALLESINA, Stefano; BODINI, Antonio; BONDAVALLI, Cristina et al.Oikos. 2005, Vol 110, Num 1, pp 164-176, issn 0030-1299, 13 p.Article

Two counterexamples in graph drawingSYKORA, O; SZEKELY, L. A; VRTO, I et al.Lecture notes in computer science. 2002, pp 391-398, issn 0302-9743, isbn 3-540-00331-2, 8 p.Conference Paper

Graph algorithms and applicationsAlgorithmica. 2000, Vol 26, Num 1, issn 0178-4617, 195 p.Conference Proceedings

SODA '95CLARKSON, Kenneth L.Journal of algorithms (Print). 1998, Vol 29, Num 2, pp 203-410, issn 0196-6774Conference Proceedings

Une propriété cachée des graphes = A hidden property of graphsDELAHAYE, Jean-Paul.Pour la science. 2008, Num 366, pp 92-97, issn 0153-4092, 6 p.Article

Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphsKAPLAN, Haim; NUSSBAUM, Yahav.Lecture notes in computer science. 2006, pp 289-300, issn 0302-9743, isbn 3-540-48381-0, 12 p.Conference Paper

Flexible matchingsBARTHA, Miklos; KRESZ, Miklos.Lecture notes in computer science. 2006, pp 313-324, issn 0302-9743, isbn 3-540-48381-0, 12 p.Conference Paper

An efficient algorithm for computing least cost paths with turn constraintsBOROUJERDI, A; UHLMANN, J.Information processing letters. 1998, Vol 67, Num 6, pp 317-321, issn 0020-0190Article

Synthesis of kinematic chains with two inversionsHWANG, W.-M; CHEN, H.-M.Mathematical and computer modelling. 1996, Vol 24, Num 11, pp 109-118, issn 0895-7177Article