Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Grafo completo")

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 1426

  • Page / 58
Export

Selection :

  • and

Contractible edges in non-separating cyclesEGAWA, Y; SAITO, A.Combinatorica (Print). 1991, Vol 11, Num 4, pp 389-392, issn 0209-9683Article

Dao : A benchmark gameDONKERS, H. H. L. M; JAAP VAN DEN HERIK, H; UITERWIJK, Jos W. H. M et al.Lecture notes in computer science. 2006, pp 202-219, issn 0302-9743, isbn 3-540-32488-7, 1Vol, 18 p.Conference Paper

Toughness and the existence of fractional k-factors of graphsGUIZHEN LIU; LANJU ZHANG.Discrete mathematics. 2008, Vol 308, Num 9, pp 1741-1748, issn 0012-365X, 8 p.Article

Looking at the starsPRIETO, Elena; SLOPER, Christian.Lecture notes in computer science. 2004, pp 138-148, issn 0302-9743, isbn 3-540-23071-8, 11 p.Conference Paper

The Ramsey numbers for a cycle of length six or seven versus a clique of order sevenEDWIN CHENG, T. C; YAOJUN CHEN; YUNQING ZHANG et al.Discrete mathematics. 2007, Vol 307, Num 9-10, pp 1047-1053, issn 0012-365X, 7 p.Article

On a conjecture of Lewin's problemBOLIAN LIU; WEN JIANG.Linear algebra and its applications. 2001, Vol 323, pp 201-206, issn 0024-3795Article

One-factorizations of complete graphs with a doubly transitive automorphism groupCAMERON, P. J; KORCHMAROS, G.Bulletin of the London Mathematical Society. 1993, Vol 25, pp 1-6, issn 0024-6093, 1Article

Packing three copies of a tree into a complete graphHONG WANG; SAUER, N.European journal of combinatorics. 1993, Vol 14, Num 2, pp 137-142, issn 0195-6698Article

ω3ω1→(ω3ω1, 3)2 requires an inaccessibleSTANLEY, L; VELLEMAN, D; MORGAN, C et al.Proceedings of the American Mathematical Society. 1991, Vol 111, Num 4, pp 1105-1118, issn 0002-9939Article

ON INTRINSICALLY KNOTTED OR COMPLETELY 3-LINKED GRAPHSHANAKI, Ryo; NIKKUNI, Ryo; TANIYAMA, Kouki et al.Pacific journal of mathematics. 2011, Vol 252, Num 2, pp 407-425, issn 0030-8730, 19 p.Article

Graph coloring and the immersion orderABU-KHZAM, Faisal N; LANGSTON, Michael A.Lecture notes in computer science. 2003, pp 394-403, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

A result about the incident edges in the graphs MkMONTENEGRO, E; SALAZAR, R.Discrete mathematics. 1993, Vol 122, Num 1-3, pp 377-380, issn 0012-365XArticle

The existence of a simple 3-(28,5,30) designYEOW MENG CHEE.Discrete mathematics. 1993, Vol 118, Num 1-3, pp 251-252, issn 0012-365XArticle

The retracts of Hamming graphsWILKEIT, E.Discrete mathematics. 1992, Vol 102, Num 2, pp 197-218, issn 0012-365XArticle

Trade spectra of complete partite graphsBILLINGTON, Elizabeth J; HOFFMAN, D. G.Discrete mathematics. 2002, Vol 250, Num 1-3, pp 23-39, issn 0012-365XArticle

Decomposition of K13 into a torus graph and a graph imbedded in the Klein bottleBORODIN, O. V; MAYER, J.Discrete mathematics. 1992, Vol 102, Num 1, pp 97-98, issn 0012-365XArticle

Kings in k-partite tournamentsPETROVIC, V; THOMASSEN, C.Discrete mathematics. 1991, Vol 98, Num 3, pp 237-238, issn 0012-365XArticle

ROMAN DOMINATION : A parameterized perspectiveFERNAU, Henning.Lecture notes in computer science. 2006, pp 262-271, issn 0302-9743, isbn 3-540-31198-X, 1Vol, 10 p.Conference Paper

Computation of the 0-dual closure for hamiltonian graphsSCHIERMEYER, I.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 455-464, issn 0012-365XConference Paper

A hyperfactorization of order 8, index 2HORTON, J. D.Discrete mathematics. 1991, Vol 92, Num 1-3, pp 127-129, issn 0012-365XArticle

Heuristic for Simulation CheckingSANTONE, Antonella.Artificial intelligence. International conferenceWorldComp'2011. 2011, pp 293-299, isbn 1-60132-183-X 1-60132-184-8 1-60132-185-6, 7 p.Conference Paper

The orientable genus of some joins of complete graphs with large edgeless graphsELLINGHAM, M. N; STEPHENS, D. Christopher.Discrete mathematics. 2009, Vol 309, Num 5, pp 1190-1198, issn 0012-365X, 9 p.Conference Paper

Composition of stable set polyhedraMCCLOSKY, Benjamin; HICKS, Illya V.Operations research letters. 2008, Vol 36, Num 5, pp 615-617, issn 0167-6377, 3 p.Article

The upper bound of essential cyclomatic numbers of hypergraphsJIANFANG WANG; HAIZHU LI.Discrete mathematics. 2002, Vol 254, Num 1-3, pp 555-564, issn 0012-365XArticle

Choice number of some complete multi-partite graphsENOMOTO, Hikoe; OHBA, Kyoji; OTA, Katsuhiro et al.Discrete mathematics. 2002, Vol 244, Num 1-3, pp 55-66, issn 0012-365XConference Paper

  • Page / 58