The binary network flow problem is logspace complete for PLENGAUER, T; WAGNER, K. W.Theoretical computer science. 1990, Vol 75, Num 3, pp 357-363, issn 0304-3975, 7 p.Article

On the edge Szeged index of bridge graphsRUNDAN XING; BO ZHOU.Comptes rendus. Mathématique. 2011, Vol 349, Num 9-10, pp 489-492, issn 1631-073X, 4 p.Article

Some notes on domination edge critical graphsNADER JAFARI RAD; SAYYED HEIDAR JAFARI.Comptes rendus. Mathématique. 2011, Vol 349, Num 9-10, pp 485-488, issn 1631-073X, 4 p.Article

Algorithms for graphic polymatroids and parametric s-setsGABOW, H. N.Journal of algorithms (Print). 1998, Vol 26, Num 1, pp 48-86, issn 0196-6774Article

The Shields-Harary number for wheel and broken wheel graphsWUNSCH, J.Discrete applied mathematics. 1995, Vol 59, Num 2, pp 193-199, issn 0166-218XArticle

A complete characterization of tolerable adversary structures for secure point-to-point transmissions without feedbackDESMEDT, Yvo; YONGGE WANG; BURMESTER, Mike et al.Lecture notes in computer science. 2005, pp 277-287, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 11 p.Conference Paper

An O(N+M)-time algorithm for finding a minimum-weight dominating set in a permutation graphRHEE, C; LIANG, Y. D; DHALL, S. K et al.SIAM journal on computing (Print). 1996, Vol 25, Num 2, pp 404-419, issn 0097-5397Article

On the size of graphs of a given bandwidthDUTTON, R. D; BRIGHAM, R. C.Discrete mathematics. 1989, Vol 76, Num 3, pp 191-195, issn 0012-365XArticle

An algorithm for cyclic edge connectivity of cubic graphs: (Extended abstract)DVORAK, Zdenek; KARA, Jan; KRAL, Daniel et al.Lecture notes in computer science. 2004, pp 236-247, issn 0302-9743, isbn 3-540-22339-8, 12 p.Conference Paper

Error compensation in leaf root problemsDOM, Michael; JIONG GUO; HÜFFNER, Falk et al.Lecture notes in computer science. 2004, pp 389-401, issn 0302-9743, isbn 3-540-24131-0, 13 p.Conference Paper

Minimum cost edge subset covering exactly k vertices of a graphPLESNIK, Jan.Journal of combinatorial optimization. 2001, Vol 5, Num 3, pp 275-286, issn 1382-6905Article

General neighbour-distinguishing index of a graphGYORI, Ervin; HORNAK, Mirko; PALMER, Cory et al.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 827-831, issn 0012-365X, 5 p.Conference Paper

Complete solution for the rainbow numbers of matchingsHE CHEN; XUELIANG LI; JIANHUA TU et al.Discrete mathematics. 2009, Vol 309, Num 10, pp 3370-3380, issn 0012-365X, 11 p.Article

Strong edge-magic graphs of maximum sizeMACDOUGALL, J. A; WALLIS, W. D.Discrete mathematics. 2008, Vol 308, Num 13, pp 2756-2763, issn 0012-365X, 8 p.Article

Super edge-magic strength of fire crackers, banana trees and unicyclic graphsSWAMINATHAN, V; JEYANTHI, P.Discrete mathematics. 2006, Vol 306, Num 14, pp 1624-1636, issn 0012-365X, 13 p.Conference Paper

Trivially noncontractible edges in a contraction critically 5-connected graphANDO, Kiyoshi.Discrete mathematics. 2005, Vol 293, Num 1-3, pp 61-72, issn 0012-365X, 12 p.Conference Paper

On k-edge-ordered graphsCHEBIKIN, Denis.Discrete mathematics. 2004, Vol 281, Num 1-3, pp 115-128, issn 0012-365X, 14 p.Article

Faster fixed-parameter tractable algorithms for matching and packing problemsFELLOWS, Michael R; KNAUER, C; NISHIMURA, N et al.Lecture notes in computer science. 2004, pp 311-322, issn 0302-9743, isbn 3-540-23025-4, 12 p.Conference Paper

Fast parallel edge colouring of graphsSAJITH, G; SAXENA, S.Journal of parallel and distributed computing (Print). 2003, Vol 63, Num 9, pp 775-785, issn 0743-7315, 11 p.Article

Pyramid and interiorPAILLONCY, J.-G.Lecture notes in computer science. 2000, pp 437-446, issn 0302-9743, isbn 3-540-67946-4Conference Paper

Two remarks on 'expanding and forwarding' by P. SoléVRT'O, I.Discrete applied mathematics. 1995, Vol 58, Num 1, pp 85-89, issn 0166-218XArticle

Invariants of E-graphsHAYNES, T. W; LAWSON, L. M.International journal of computer mathematics. 1995, Vol 55, Num 1-2, pp 19-27, issn 0020-7160Article

Topologie de l'opération d'arrondi d'arêtes: de l'art d'arrondir les angles = Topology of the rounding edge operationFUCHS, L; ELTER, H.Revue internationale de C.F.A.O. et d'infographie. 1994, Vol 9, Num 6, pp 807-829, issn 0298-0924Conference Paper

The bounded chromatic number for graphs of genus gBERMAN, K. A; PAUL, J. L.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 183-196, issn 0095-8956Article

Equipartitions of graphsEPPSTEIN, D; FEIGENBAUM, J; CHUNG-LUN LI et al.Discrete mathematics. 1991, Vol 91, Num 3, pp 239-248, issn 0012-365XArticle