Multi-tilde-bar expressions and their automataCARON, Pascal; CHAMPARNAUD, Jean-Marc; MIGNOT, Ludovic et al.Acta informatica. 2012, Vol 49, Num 6, pp 413-436, issn 0001-5903, 24 p.Article

Labeling schemes for flow and connectivityKATZ, Michal; KATZ, Nir A; KORMAN, Amos et al.SIAM journal on computing (Print). 2005, Vol 34, Num 1, pp 23-40, issn 0097-5397, 18 p.Article

TRANSFORMING TRIANGULATIONS ON NONPLANAR SURFACESCORTES, C; CRIMA, C. I; HURTADO, F et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 821-840, issn 0895-4801, 20 p.Article

FINDING PATHS AND CYCLES OF SUPERPOLYLOGARITHMIC LENGTHGABOW, Harold N.SIAM journal on computing (Print). 2007, Vol 36, Num 6, pp 1648-1671, issn 0097-5397, 24 p.Article

COMPUTING THE GIRTH OF A PLANAR GRAPH IN O(nlogn) TIMEWEIMANN, Oren; YUSTER, Raphael.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 2, pp 609-616, issn 0895-4801, 8 p.Article

A characterization of hypercactiSONNTAG, Martin.Discrete mathematics. 2007, Vol 307, Num 21, pp 2615-2621, issn 0012-365X, 7 p.Article

Powerful alliances in graphsBRIGHAM, Robert C; DUTTON, Ronald D; HAYNES, Teresa W et al.Discrete mathematics. 2009, Vol 309, Num 8, pp 2140-2147, issn 0012-365X, 8 p.Article

HARDNESS OF THE UNDIRECTED CONGESTION MINIMIZATION PROBLEMANDREWS, Matthew; ZHANG, Lisa.SIAM journal on computing (Print). 2008, Vol 37, Num 1, pp 112-131, issn 0097-5397, 20 p.Article

Roman dominating influence parametersRUBALCABA, Robert R; SLATER, Peter J.Discrete mathematics. 2007, Vol 307, Num 24, pp 3194-3200, issn 0012-365X, 7 p.Article

Construction of a family of graphs with a small induced proper subgraph with minimum degree 3CHOI, Sul-Young; PUHUA GUAN.Discrete mathematics. 2007, Vol 307, Num 16, pp 1999-2001, issn 0012-365X, 3 p.Article

Complete r-partite subgraphs of dense r-graphsNIKIFOROV, Vladimir.Discrete mathematics. 2009, Vol 309, Num 13, pp 4326-4331, issn 0012-365X, 6 p.Article

SPANNERS OF COMPLETE k-PARTITE GEOMETRIC GRAPHSBOSE, Prosenjit; CARMI, Paz; COUTURE, Mathieu et al.SIAM journal on computing (Print). 2009, Vol 38, Num 5, pp 1803-1820, issn 0097-5397, 18 p.Article

Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorableYINGQIAN WANG; MING CHEN; LIANG SHEN et al.Discrete mathematics. 2008, Vol 308, Num 17, pp 4014-4017, issn 0012-365X, 4 p.Article

Optimal 1-planar graphs which triangulate other surfacesSUZUKI, Yusuke.Discrete mathematics. 2010, Vol 310, Num 1, pp 6-11, issn 0012-365X, 6 p.Article

Rubbling and optimal rubbling of graphsBELFORD, Christopher; SIEBEN, Nandor.Discrete mathematics. 2009, Vol 309, Num 10, pp 3436-3446, issn 0012-365X, 11 p.Article

On the order of ({r, m}; g)-cages of even girthARAUJO-PARDO, G; BALBUENA, C; GARCAI-VAZQUEZ, P et al.Discrete mathematics. 2008, Vol 308, Num 12, pp 2484-2491, issn 0012-365X, 8 p.Article

Forbidden subgraphs and the existence of paths and cycles passing through specified verticesFUJISAWA, Jun; OTA, Katsuhiro; SUGIYAMA, Takeshi et al.Discrete mathematics. 2008, Vol 308, Num 24, pp 6111-6114, issn 0012-365X, 4 p.Article

A sum labelling for the generalised friendship graphFERNAU, Henning; RYAN, Joe F; SUGENG, Kiki A et al.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 734-740, issn 0012-365X, 7 p.Conference Paper

Conference structures and consistencyALBIZURI, M. J; ZARZUELO, J. M.Discrete mathematics. 2009, Vol 309, Num 16, pp 4969-4976, issn 0012-365X, 8 p.Article

Excessive near 1-factorizationsCARIOLARO, David; FU, Hung-Lin.Discrete mathematics. 2009, Vol 309, Num 14, pp 4690-4696, issn 0012-365X, 7 p.Article

A generalised upper bound for the k-tuple domination numberGAGARIN, Andrei; ZVEROVICH, Vadim E.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 880-885, issn 0012-365X, 6 p.Conference Paper

Covering the vertices of a graph with cycles of bounded lengthBEKKAI, Siham; FORGE, David; KOUIDER, Mekkia et al.Discrete mathematics. 2009, Vol 309, Num 8, pp 1963-1966, issn 0012-365X, 4 p.Article

Path transferability of graphsTORII, Ryuzo.Discrete mathematics. 2008, Vol 308, Num 17, pp 3782-3804, issn 0012-365X, 23 p.Article

Chromatic uniqueness of a family of K₄-homeomorphsPENG, Yan-Ling.Discrete mathematics. 2008, Vol 308, Num 24, pp 6132-6140, issn 0012-365X, 9 p.Article

Coloring the Cartesian sum of graphsDER-FEN LIU, Daphne; XUDING ZHU.Discrete mathematics. 2008, Vol 308, Num 24, pp 5928-5936, issn 0012-365X, 9 p.Article