RANDOM EDGE can be exponential on abstract cubesMATOUSEK, Jiri; SZABO, Tibor.Annual Symposium on Foundations of Computer Science. 2004, pp 92-100, isbn 0-7695-2228-9, 1Vol, 9 p.Conference Paper

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

The chromatic index of nearly bipartite multigraphsEGGAN, L; PLANTHOLT, M.Journal of combinatorial theory. Series B. 1986, Vol 40, Num 1, pp 71-80, issn 0095-8956Article

On the intersection of edges of a geometric graph by straight linesALON, N; PERLES, M. A.Discrete mathematics. 1986, Vol 60, pp 75-90, issn 0012-365XArticle

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

On universality of graphs with uniformly distributed edgesRODL, V.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 125-134, issn 0012-365XArticle

Hypergraphs and Whitney's theorem on edge-isomorphisms of graphsGARDNER, M. L.Discrete mathematics. 1984, Vol 51, Num 1, pp 1-9, issn 0012-365XArticle

Regular graphs and edge chromatic numberFAUDREE, R. J; SHEEHAN, J.Discrete mathematics. 1984, Vol 48, Num 2-3, pp 197-204, issn 0012-365XArticle

Convex hull of the edges of a graph and near bipartite graphsMAURRAS, J.-F.Discrete mathematics. 1983, Vol 46, Num 3, pp 257-265, issn 0012-365XArticle

On unavoidable graphsCHUNG, F. R. K; ERDOS, P.Combinatorica (Print). 1983, Vol 3, Num 2, pp 167-176, issn 0209-9683Article

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

A generalization of edge-coloring in graphsHAKIMI, S. L; KARIV, O.Journal of graph theory. 1986, Vol 10, Num 2, pp 139-154, issn 0364-9024Article

Simple 3-polytopal graphs with edges of only two types and shortness coefficientsOWENS, P. J.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 107-114, issn 0012-365XArticle

Super line-connectivity properties of circulant graphsBOESCH, F. T; WANG, J. F.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 1, pp 89-98, issn 0196-5212Article

Even edge colorings of a graphALON, N; EGAWA, Y.Journal of combinatorial theory. Series B. 1985, Vol 38, Num 1, pp 93-94, issn 0095-8956Article

Equations ellipiques du second ordre sur les graphesMERKOV, A. B.Matematičeskij sbornik (Moskva). 1985, Vol 127, Num 4, pp 502-518, issn 0368-8666Article

Duality and perfection for edges in cliquesALBERTSON, M. O; COLLINS, K. L.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 3, pp 298-309, issn 0095-8956Article

Edge-colorability of graph bundlesPISANSKI, T; SHAWE-TAYLOR, J; VRABEC, J et al.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 1, pp 12-19, issn 0095-8956Article

Even edge colorings of a graphACHARYA, B. D.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 1, pp 78-79, issn 0095-8956Article

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

Applications of edge coverings by cliquesROBERTS, F. S.Discrete applied mathematics. 1985, Vol 10, Num 1, pp 93-109, issn 0166-218XArticle