Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Sous graphe")

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 1656

  • Page / 67
Export

Selection :

  • and

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

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

Subgraphs of minimal degree kERDOÊS, P; FAUDREE, R. J; ROUSSEAU, C. C et al.Discrete mathematics. 1990, Vol 85, Num 1, pp 53-58, issn 0012-365X, 6 p.Article

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

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 DERIVATION OF MAXIMAL COMMON SUBGRAPHS OF TWO DIRECTED OR UNDIRECTED GRAPHSLEVI G.1972; CALCOLO; ITAL.; DA. 1972; VOL. 9; NO 4; PP. 341-352; BIBL. 11 REF.Serial Issue

GEODESIC SUBGRAPHSBATTEN LM.1983; JOURNAL OF GRAPH THEORY; ISSN 0364-9024; USA; DA. 1983; VOL. 7; NO 2; PP. 159-163; BIBL. 5 REF.Article

ON THE (4-3)-REGULAR SUBGRAPH CONJECTUREPARTHASARATHY KR; SRIDHARAN S.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 368-379; BIBL. 3 REF.Conference Paper

SPANNING SUBGRAPHS WITH SPECIFIED VALENCIES.TUTTE WT.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 9; NO 1; PP. 97-108; BIBL. 9 REF.Article

FIXING SUBGRAPHS OF S-REGULAR GRAPHSSHEEHAN J.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 1; PP. 100-103; BIBL. 4 REF.Serial Issue

Planar graph coloring with forbidden subgraphs: Why trees and paths are dangerousBROERSMA, Hajo; FOMIN, Fedor V; KRATOCHVIL, Jan et al.Lecture notes in computer science. 2002, pp 160-169, issn 0302-9743, isbn 3-540-43866-1, 10 p.Conference Paper

The induced path convexity, betweenness, and svelte graphsMORGANA, Maria Aurora; MULDER, Henry Martyn.Discrete mathematics. 2002, Vol 254, Num 1-3, pp 349-370, issn 0012-365XArticle

A degree condition for spanning Eulerian subgraphsZHI-HONG CHEN.Journal of graph theory. 1993, Vol 17, Num 1, pp 5-21, issn 0364-9024Article

AN EFFICIENT HEURISTIC FOR IDENTIFYING A MAXIMUM WEIGHT PLANAR SUBGRAPHEADES P; FOULDS L; GIFFIN J et al.1982; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1982; NO 952; PP. 239-251; BIBL. 16 REF.Conference Paper

ON EULERIAN SUBGRAPHS OF COMPLEMENTARY GRAPHSNEBESKY L.1979; CZECHOSL. MATH. J.; CSK; DA. 1979; VOL. 29; NO 2; PP. 298-302; BIBL. 4 REF.Article

ON COMPLETE SUBGRAPHS OF R-CHROMATIC GRAPHS.BOLLOBAS B; ERDOS P; SZEMEREDI E et al.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 13; NO 2; PP. 97-107; BIBL. 9 REF.Article

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

Graph spannersPELEG, D; SCHÄFFER, A. A.Journal of graph theory. 1989, Vol 13, Num 1, pp 99-116, issn 0364-9024Article

Every graph is contained in a sparsest possible balanced graphGYORI, E; ROTHSCHILD, B; RUNCINSKI, A et al.Mathematical proceedings of the Cambridge Philosophical Society. 1987, Vol 98, Num 3, pp 397-401, issn 0305-0041Article

Testing the ODD bicycle wheel inequalities for the bipartite subgraph polytopeGERARDS, A. M. H.Mathematics of operations research. 1985, Vol 10, Num 2, pp 359-360, issn 0364-765XArticle

Regular subgraphs of almost regular graphsALON, N; FRIEDLAND, S; KALAI, G et al.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 79-91, issn 0095-8956Article

On a class of degenerate extremal graph problemsFAUDREE, R. J; SIMONOVITS, M.Combinatorica (Print). 1983, Vol 3, Num 1, pp 83-93, issn 0209-9683Article

  • Page / 67