Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Subgraph")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1603

  • Page / 65
Export

Selection :

  • and

On maximum number of edges in a spanning eulerian subgraphDENGXIN LI; DEYING LI; JINGZHONG MAO et al.Discrete mathematics. 2004, Vol 274, Num 1-3, pp 299-302, issn 0012-365X, 4 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

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

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

Some new hereditary classes where graph coloring remains NP-hardSCHINDL, D.Discrete mathematics. 2005, Vol 295, Num 1-3, pp 197-202, issn 0012-365X, 6 p.Article

On canonical antichainsGUOLI DING.Discrete mathematics. 2009, Vol 309, Num 5, pp 1123-1134, issn 0012-365X, 12 p.Conference Paper

Hereditarily dominated graphsMICHALAK, Danuta.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 952-957, issn 0012-365X, 6 p.Conference Paper

Approximating node connectivity problems via set coversKORTSARZL, G; NUTOV, Z.Lecture notes in computer science. 2000, pp 194-205, issn 0302-9743, isbn 3-540-67996-0Conference Paper

Parity and disparity subgraphsMCKEE, Terry A; VOLKMANN, Lutz.Discrete mathematics. 2009, Vol 309, Num 8, pp 2608-2612, issn 0012-365X, 5 p.Article

Subgraphs of 4-Regular Planar GraphsDOWDEN, Chris; ADDARIO-BERRY, Louigi.Algorithmica. 2011, Vol 61, Num 3, pp 758-776, issn 0178-4617, 19 p.Article

Structure and Recognition of Graphs with No 6-wheel SubdivisionROBINSON, Rebecca; FARR, Graham.Algorithmica. 2009, Vol 55, Num 4, pp 703-728, issn 0178-4617, 26 p.Article

GRAPHS HAVING SMALL NUMBER OF SIZES ON INDUCED k-SUBGRAPHSAXENOVICH, Maria; BALOGH, Jozsef.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 1, pp 264-272, issn 0895-4801, 9 p.Article

Counterexample to a conjecture of Györi on C2l-free bipartite graphsBALBUENA, C; GARCIA-VAZQUEZ, P; MARCOTE, X et al.Discrete mathematics. 2007, Vol 307, Num 6, pp 748-749, issn 0012-365X, 2 p.Article

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

Existence of two disjoint long cycles in graphsEGAWA, Yoshimi; FUJITA, Shinya; KAWARABAYASHI, Ken-Ichi et al.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 154-169, issn 0012-365X, 16 p.Article

On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphsKRIESELL, Matthias.Discrete mathematics. 2010, Vol 310, Num 20, pp 2714-2724, issn 0012-365X, 11 p.Article

Retracts of hypercubesBANDELT, H. J.Journal of graph theory. 1984, Vol 8, Num 4, pp 501-510, issn 0364-9024Article

Isomorphic subgraphs having minimal intersectionsMULLIN, R. C; ROY, B. K; SCHELLENBERG, P. J et al.Journal of the Australian Mathematical Society. Series A, Pure mathematics. 1983, Vol 35, Num 3, pp 287-306, issn 0334-3316Article

A note on the complexity of finding regular subgraphsPLESNIK, J.Discrete mathematics. 1984, Vol 49, Num 2, pp 161-167, issn 0012-365XArticle

LARGE NEARLY REGULAR INDUCED SUBGRAPHSALON, Noga; KRIVELEVICH, Michael; SUDAKOV, Benny et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 4, pp 1325-1337, issn 0895-4801, 13 p.Article

On the number of connected convex subgraphs of a connected acyclic digraphGUTIN, Gregory; YEO, Anders.Discrete applied mathematics. 2009, Vol 157, Num 7, pp 1660-1662, issn 0166-218X, 3 p.Article

Counting k-component forests of a graphMYRVOLD, W.Networks (New York, NY). 1992, Vol 22, Num 7, pp 647-652, issn 0028-3045Article

Extremal subgraphs for two graphsCHUNG, F. R. K; ERDOS, P; SPENCER, J et al.Journal of combinatorial theory. Series B. 1985, Vol 38, Num 3, pp 248-260, issn 0095-8956Article

Maximum bipartite subgraphs of cubic triangle-free planar graphsQING CUI; JIAN WANG.Discrete mathematics. 2009, Vol 309, Num 5, pp 1091-1111, issn 0012-365X, 21 p.Conference Paper

On the second Laplacian eigenvalues of trees of odd orderSHAO, Jia-Yu; LI ZHANG; YUAN, Xi-Ying et al.Linear algebra and its applications. 2006, Vol 419, Num 2-3, pp 475-485, issn 0024-3795, 11 p.Article

  • Page / 65