α-Vertex separator is NP-Hard even for 3-Regular graphsMÜLLER, R; WAGNER, D.Computing (Wien. Print). 1991, Vol 46, Num 4, pp 343-353, issn 0010-485XArticle

The probability of a rendezvous is minimal in complete graphsDIETZFELBINGER, Martin.Lecture notes in computer science. 2002, pp 55-66, issn 0302-9743, isbn 3-540-00142-5, 12 p.Conference Paper

A counterexample to Seymour's self-minor conjectureOPOROWSKI, B.Journal of graph theory. 1990, Vol 14, Num 5, pp 521-524, issn 0364-9024Article

Connectivité des graphes de Cayley Abeliens sans K₄YAHYA OULD HAMIDOUNE.Discrete mathematics. 1990, Vol 83, Num 1, pp 21-26, issn 0012-365XArticle

Planarity testing of graphs on base of a spring modelHOTZ, Günter; LOHSE, Steffen.Lecture notes in computer science. 2002, pp 471-472, issn 0302-9743, isbn 3-540-43309-0Conference Paper

Competition graphs of strongly connected and Hamiltonian digraphsFRAUGHNAUGH, K. F; LUNDGREN, J. R; MERZ, S. K et al.SIAM journal on discrete mathematics (Print). 1995, Vol 8, Num 2, pp 179-185, issn 0895-4801Article

Maximum diameter of regular digraphsSOARES, J.Journal of graph theory. 1992, Vol 16, Num 5, pp 437-450, issn 0364-9024Article

Cycles containing 12 vertices in 3-connected cubic graphsSHENG BAU; HOLTON, D.Journal of graph theory. 1991, Vol 15, Num 4, pp 421-429, issn 0364-9024Article

Partitions and orientations of the rado graphDIESTEL, Reinhard; LEADER, Imre; SCOTT, Alex et al.Transactions of the American Mathematical Society. 2007, Vol 359, Num 5, pp 2395-2405, issn 0002-9947, 11 p.Article

On three zero-sum Ramsey-type problemsALON, N; CARO, Y.Journal of graph theory. 1993, Vol 17, Num 2, pp 177-192, issn 0364-9024Article

Directed tree structure of the set of Kekulé patterns of generalized polyhex graphsZHANG FUJI; GUO XIAOFENG.Discrete applied mathematics. 1991, Vol 32, Num 3, pp 295-302, issn 0166-218XArticle

A characterization of Grassmann and Johnson graphsNUMATA, M.Journal of combinatorial theory. Series B. 1990, Vol 48, Num 2, pp 178-190, issn 0095-8956Article

The second largest number of maximal independent sets in connected graphs with at most one cycleJOU, Min-Jen.Journal of combinatorial optimization. 2012, Vol 24, Num 3, pp 192-201, issn 1382-6905, 10 p.Article

Packing dicycle covers in planar graphs with no K₅ -e minorLEE, Orlando; WILLIAMS, Aaron.Lecture notes in computer science. 2006, pp 677-688, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

The interval number of dense graphsBALOGH, Jozsef; PLUHAR, Andras.Discrete mathematics. 2002, Vol 256, Num 1-2, pp 423-429, issn 0012-365XArticle

Pancyclic orderings of in-tournamentsTEWES, Meike.Discrete applied mathematics. 2002, Vol 120, Num 1-3, pp 239-249, issn 0166-218XConference Paper

Plane graphs with acyclic complexBAOGANG XU.Lecture notes in computer science. 2001, pp 395-399, issn 0302-9743, isbn 3-540-42494-6Conference Paper

Generalized rotation numbersCHAPMAN, R. J; HAVILAND, J.Journal of graph theory. 1993, Vol 17, Num 3, pp 291-301, issn 0364-9024Article

On minimal neighbourhood-connected graphsHARTNELL, B. L; KOCAY, W.Discrete mathematics. 1991, Vol 92, Num 1-3, pp 95-105, issn 0012-365XArticle

Bounding the size of planar intertwinesGUPTA, A; IMPAGLIAZZO, R.SIAM journal on discrete mathematics (Print). 1997, Vol 10, Num 3, pp 337-358, issn 0895-4801Article

Geometric characterization of graphs from the Suzuki chainPASECHNIK, D. V.European journal of combinatorics. 1993, Vol 14, Num 5, pp 491-499, issn 0195-6698Article

Extremal subgraphs of random graphsBABAI, L; SIMONOVITS, M; SPENCER, J et al.Journal of graph theory. 1990, Vol 14, Num 5, pp 599-622, issn 0364-9024Article

k-linked and k-cyclic digraphsMANOUSSAKIS, Y.Journal of combinatorial theory. Series B. 1990, Vol 48, Num 2, pp 216-226, issn 0095-8956Article

The klein bottle and multicommodity flowsSCHRIJVER, A.Combinatorica (Print). 1989, Vol 9, Num 4, pp 375-384, issn 0209-9683Article

A short proof of Fleischner's theoremGEORGAKOPOULOS, Agelos.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6632-6634, issn 0012-365X, 3 p.Article