Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Transversal(graphe)")

Publication Year[py]

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

Discipline (document) [di]

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 65

  • Page / 3
Export

Selection :

  • and

Transversals in long rectangular arraysAKBARI, S; ETESAMI, O; MAHINI, H et al.Discrete mathematics. 2006, Vol 306, Num 23, pp 3011-3013, issn 0012-365X, 3 p.Conference Paper

Odd neighborhood transversals on grid graphsCOWEN, Robert; HECHLER, Stephen H; KENNEDY, John W et al.Discrete mathematics. 2007, Vol 307, Num 17-18, pp 2200-2208, issn 0012-365X, 9 p.Article

A note on the expected behaviour of binary tree traversalsANDERSSON, A.Computer journal (Print). 1990, Vol 33, Num 5, pp 471-472, issn 0010-4620, 2 p.Article

ON ROTA'S BASIS CONJECTUREGEELEN, Jim; WEBB, Kerri.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 3, pp 802-804, issn 0895-4801, 3 p.Article

Rota's basis conjecture for paving matroidsGEELEN, Jim; HUMPHRIES, Peter. J.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 4, pp 1042-1045, issn 0895-4801, 4 p.Article

Real κ-flats tangent to quadrics in RnSOTTILE, Frank; THEOBALD, Thorsten.Proceedings of the American Mathematical Society. 2005, Vol 133, Num 10, pp 2835-2844, issn 0002-9939, 10 p.Article

On left Hadamard transversals in non-solvable groupsHIRAMINE, Yutaka; ITO, Noboru.Discrete mathematics. 2008, Vol 308, Num 13, pp 2776-2780, issn 0012-365X, 5 p.Article

Berge's theorem, fractional Helly, and art galleriesBARANY, Imre; MATOUSEK, Riri.Discrete mathematics. 2006, Vol 306, Num 19-20, pp 2303-2313, issn 0012-365X, 11 p.Article

Existence of strong symmetric self-orthogonal diagonal Latin squaresCAO, H; LI, W.Discrete mathematics. 2011, Vol 311, Num 10-11, pp 841-843, issn 0012-365X, 3 p.Article

Quarter-regular biembeddings of Latin squaresDONOVAN, D. M; DRAPAL, A; GRANNELL, M. J et al.Discrete mathematics. 2010, Vol 310, Num 4, pp 692-699, issn 0012-365X, 8 p.Article

On linear partial spreadsPAVAN, Andrea; ZANELLA, Corrado.Discrete mathematics. 2012, Vol 312, Num 3, pp 578-583, issn 0012-365X, 6 p.Conference Paper

Large sets of resolvable idempotent Latin squaresJUNLING ZHOU; YANXUN CHANG; ZIHONG TIAN et al.Discrete mathematics. 2011, Vol 311, Num 1, pp 24-31, issn 0012-365X, 8 p.Article

Group divisible designs with block size four and group type gum1 where g is a multiple of 8SCHUSTER, Ernst.Discrete mathematics. 2010, Vol 310, Num 17-18, pp 2258-2270, issn 0012-365X, 13 p.Article

Existence of r-self-orthogonal Latin squaresYUNQING XU; YANXUN CHANG.Discrete mathematics. 2006, Vol 306, Num 1, pp 124-146, issn 0012-365X, 23 p.Article

On STDk3[k; 3]'sAKIYAMA, Kenzi; SUETAKE, Chihiro.Discrete mathematics. 2008, Vol 308, Num 24, pp 6449-6465, issn 0012-365X, 17 p.Article

Parameterized enumeration, transversals, and imperfect phylogeny reconstructionDAMASCHKE, Peter.Theoretical computer science. 2006, Vol 351, Num 3, pp 337-350, issn 0304-3975, 14 p.Conference Paper

A generalization of plexes of Latin squaresPULA, Kyle.Discrete mathematics. 2011, Vol 311, Num 8-9, pp 577-581, issn 0012-365X, 5 p.Article

On P4-transversals of chordal graphsSTACHO, Juraj.Discrete mathematics. 2008, Vol 308, Num 23, pp 5548-5554, issn 0012-365X, 7 p.Article

On the number of minimal transversals in 3-uniform hypergraphsLONC, Zbigniew; TRUSZCZYNSKI, Miroslaw.Discrete mathematics. 2008, Vol 308, Num 16, pp 3668-3687, issn 0012-365X, 20 p.Article

Distance-hereditary graphs are clique-perfectLEE, Chuan-Min; CHANG, Maw-Shang.Discrete applied mathematics. 2006, Vol 154, Num 3, pp 525-536, issn 0166-218X, 12 p.Article

LINE TRANSVERSALS OF CONVEX POLYHEDRA IN ℝ3KAPLAN, Haim; RUBIN, Natan; SHARIR, Micha et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3283-3310, issn 0097-5397, 28 p.Article

A unified approach to parallel depth-first traversals of general treesCHEN, C. C.-Y; DAS, S. K; AKL, S. G et al.Information processing letters. 1991, Vol 38, Num 1, pp 49-55, issn 0020-0190, 7 p.Article

Traversing graphs in a paging environment, BFS or DFS?BIN JIANG.Information processing letters. 1991, Vol 37, Num 3, pp 143-147, issn 0020-0190, 5 p.Article

Construction of a tree from its traversals in optimal time and spaceANDERSSON, A; CARLSSON, S.Information processing letters. 1990, Vol 34, Num 1, pp 21-25, issn 0020-0190Article

Polynomial-time dualization of r-exact hypergraphs with applications in geometryELBASSIONI, Khaled; RAUF, Imran.Discrete mathematics. 2010, Vol 310, Num 17-18, pp 2356-2363, issn 0012-365X, 8 p.Article

  • Page / 3