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

On Halin subgraphs and supergraphsHORTON, S. B; PARKER, R. G.Discrete applied mathematics. 1995, Vol 56, Num 1, pp 19-35, issn 0166-218XArticle

On the number of non-isomorphic subgraphsSHELAH, S; SOUKUP, L.Israel Journal of Mathematics. 1994, Vol 86, Num 1-3, pp 349-371, issn 0021-2172Article

Spanning Forest Polynomials and the Transcendental Weight of Feynman GraphsBROWN, Francis; YEATS, Karen.Communications in mathematical physics. 2011, Vol 301, Num 2, pp 357-382, issn 0010-3616, 26 p.Article

Lightness, heaviness and gravityMADARAS, Tomas; SKREKOVSKI, Riste.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 939-951, issn 0012-365X, 13 p.Conference Paper

Finding a weight-constrained maximum-density subtree in a treeHSIEH, Sun-Yuan; CHOU, Ting-Yu.Lecture notes in computer science. 2005, pp 944-953, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

The hierarchical backbone of complex networksDA FONTOURA COSTA, Luciano.Physical review letters. 2004, Vol 93, Num 9, pp 098702.1-098702.4, issn 0031-9007Article

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

Approximation Scheme for Lowest Outdegree Orientation and Graph Density MeasuresKOWALIK, Lukasz.Lecture notes in computer science. 2006, pp 557-566, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

On graphs whose star complement for -2 is a path or a cycleBELL, Francis K; SIMIC, Slobodan K.Linear algebra and its applications. 2004, Vol 377, pp 249-265, issn 0024-3795, 17 p.Article

(g, f)-Factorizations orthogonal to k subgraphsHAODI FENG.Lecture notes in computer science. 2001, pp 129-139, issn 0302-9743, isbn 3-540-42707-4Conference Paper

Axioms for generalized graphs, illustrated by a Cantor-Bernstein propositionENGELFRIET, J; GELSEMA, T.Acta informatica. 1998, Vol 35, Num 12, pp 1075-1096, issn 0001-5903Article

Contractible subgraphs and morita equivalence of graph C*-algebrasCRISP, Tyrone; GOW, Daniel.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 7, pp 2003-2013, issn 0002-9939, 11 p.Article

Standard graphs in lens spacesWU, Ying-Qing.Pacific journal of mathematics. 2005, Vol 220, Num 2, pp 389-397, issn 0030-8730, 9 p.Article

A Distributed Algorithm for Finding Minimal Feedback Vertex Sets in Directed Split-StarsWANG, Fu-Hsing; HSU, Cheng-Ru.International Symposium on Parallel Architectures, Algorithms, and Networks. 2004, pp 174-179, isbn 0-7695-2135-5, 1Vol, 6 p.Conference Paper

On the hardness of approximating spannersKORTSARZ, G.Algorithmica. 2001, Vol 30, Num 3, pp 432-450, issn 0178-4617Article

Degree-constrained network spanners with nonconstant delayLIESTMAN, A. L; SHERMER, T. C.SIAM journal on discrete mathematics (Print). 1995, Vol 8, Num 2, pp 291-321, issn 0895-4801Article

Outerplanarity of line graphs and iterated line graphsHUIQIU LIN; WEIHUA YANG; HAILIANG ZHANG et al.Applied mathematics letters. 2011, Vol 24, Num 7, pp 1214-1217, issn 0893-9659, 4 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

Odd subgraphs and matchingsKANO, M; KATONA, Gyula Y.Discrete mathematics. 2002, Vol 250, Num 1-3, pp 265-272, issn 0012-365XArticle

The number of edges in a subgraph of a Hamming graphSQUIER, R; TORRENCE, B; VOGT, A et al.Applied mathematics letters. 2001, Vol 14, Num 6, pp 701-705, issn 0893-9659Article

Small integral flows need only sparse networksALTHÖFER, I.Networks (New York, NY). 1994, Vol 24, Num 4, pp 263-266, issn 0028-3045Article

Graph algorithms for conformance testing using the rural Chinese postman tourSHEN, Y. N; LOMBARDI, F.SIAM journal on discrete mathematics (Print). 1996, Vol 9, Num 4, pp 511-528, issn 0895-4801Article

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

Rank, term rank, and chromatic numberFISHKIND, Donniell E; KOTLOV, Andrei.Discrete mathematics. 2002, Vol 250, Num 1-3, pp 253-257, issn 0012-365XArticle