Independence number and vertex-disjoint cyclesEGAWA, Yoshimi; ENOMOTO, Hikoe; JENDROL, Stanislav et al.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1493-1498, issn 0012-365X, 6 p.Conference Paper

Lower bounding the boundary of a graph in terms of its maximum or minimum degreeMÜLLER, Tobias; POR, Attila; SERENI, Jean-Sébastien et al.Discrete mathematics. 2008, Vol 308, Num 24, pp 6581-6583, issn 0012-365X, 3 p.Article

Bounds for convex crossing numbersSHAHROKHI, Farhad; SYKORA, Ondrej; SZEKELY, Laszlo A et al.Lecture notes in computer science. 2003, pp 487-495, issn 0302-9743, isbn 3-540-40534-8, 9 p.Conference Paper

Random trees with superexponential branching weightsJASON, Svante; JONSSON, Thordur; STEFANSSON, Sigurdur Örn et al.Journal of physics. A, Mathematical and theoretical (Print). 2011, Vol 44, Num 48, issn 1751-8113, 485001.1-485002.16Article

The Plebanski sectors of the EPRL vertexENGLE, Jonathan.Classical and quantum gravity (Print). 2011, Vol 28, Num 22, issn 0264-9381, 225003.1-225003.16Article

Direct measurements of Ab and Ac using vertex and kaon charge tags at the SLAC detectorABE, Koya; ABE, Kenji; BAUER, J. M et al.Physical review letters. 2005, Vol 94, Num 9, pp 091801.1-091801.5, issn 0031-9007Article

Vertex operator for the non-autonomous ultradiscrete KP equationNAKATA, Yoichi.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 19, issn 1751-8113, 195201.1-195201.8Article

Spanning trees on lattices and integral identitiesCHANG, Shu-Chiuan; WENYA WANG.Journal of physics. A, mathematical and general. 2006, Vol 39, Num 33, pp 10263-10275, issn 0305-4470, 13 p.Article

A sufficient condition for boundedness of tolerance graphsEISERMANN, Birk.Discrete applied mathematics. 2011, Vol 159, Num 17, pp 2165-2169, issn 0166-218X, 5 p.Article

Changing and unchanging of the domination number of a graphSAMODIVKIN, Vladimir.Discrete mathematics. 2008, Vol 308, Num 22, pp 5015-5025, issn 0012-365X, 11 p.Article

Restricted domination parameters in graphsGODDARD, Wayne; HENNING, Michael A.Journal of combinatorial optimization. 2007, Vol 13, Num 4, pp 353-363, issn 1382-6905, 11 p.Article

Informative labeling schemes for graphsPELEG, David.Theoretical computer science. 2005, Vol 340, Num 3, pp 577-593, issn 0304-3975, 17 p.Conference Paper

Circular vertex arboricityGUANGHUI WANG; SHAN ZHOU; GUIZHEN LIU et al.Discrete applied mathematics. 2011, Vol 159, Num 12, pp 1231-1238, issn 0166-218X, 8 p.Article

Vertex-magic labelings of regular graphs IIGRAY, I. D; MACDOUGALL, J. A.Discrete mathematics. 2009, Vol 309, Num 20, pp 5986-5999, issn 0012-365X, 14 p.Article

HOMOTOPY ON SPATIAL GRAPHS AND THE SATO-LEVINE INVARIANTFLEMING, Thomas; NIKKUNI, Ryo.Transactions of the American Mathematical Society. 2009, Vol 361, Num 4, pp 1885-1902, issn 0002-9947, 18 p.Article

On the feedback vertex set problem in permutation graphsLIANG, Y. D.Information processing letters. 1994, Vol 52, Num 3, pp 123-129, issn 0020-0190Article

Groupies in random graphsFERNANDEZ DE LA VEGA, W; TUZA, Zsolt.Information processing letters. 2009, Vol 109, Num 7, pp 339-340, issn 0020-0190, 2 p.Article

On-line arbitrarily vertex decomposable treesHORNAK, Mirko; TUZA, Zsolt; WOZNIAK, Mariusz et al.Discrete applied mathematics. 2007, Vol 155, Num 11, pp 1420-1429, issn 0166-218X, 10 p.Article

Parameterized enumeration, transversals, and imperfect phylogeny reconstructionDAMASCHKE, Peter.Theoretical computer science. 2006, Vol 351, Num 3, pp 337-350, issn 0304-3975, 14 p.Conference Paper

Vertex-disjoint 4-cycles containing specified edges in a bipartite graphMATSUMURA, Haiime.Discrete mathematics. 2005, Vol 297, Num 1-3, pp 78-90, issn 0012-365X, 13 p.Article

Some structural properties of planar graphs and their applications to 3-choosabilityMIN CHEN; MONTASSIER, Mickaël; RASPAUD, Andre et al.Discrete mathematics. 2012, Vol 312, Num 2, pp 362-373, issn 0012-365X, 12 p.Article

SURVIVING RATES OF GRAPHS WITH BOUNDED TREEWIDTH FOR THE FIREFIGHTER PROBLEMLEIZHEN CAI; YONGXI CHENG; VERBIN, Elad et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 4, pp 1322-1335, issn 0895-4801, 14 p.Article

Vertex arboricity of integer distance graph G(D_m,k)ZUO, Lian-Cui; QINGLIN YU; WU, Jian-Liang et al.Discrete mathematics. 2009, Vol 309, Num 6, pp 1649-1657, issn 0012-365X, 9 p.Article

Solution of the conjecture : If n ≡ 0(mod 4), n > 4, then K_n has a super vertex-magic total labelingGOMEZ, J.Discrete mathematics. 2007, Vol 307, Num 21, pp 2525-2534, issn 0012-365X, 10 p.Article

Vertex-oblique graphsSCHREYER, Jens; WALTHER, Hansjoachim; MEL'NIKOV, Leonid S et al.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1538-1544, issn 0012-365X, 7 p.Conference Paper