:facetid:toc:\"db/journals/dm/dm96.bht\"OK:facetid:toc:db/journals/dm/dm96.bhtShreeram S. AbhyankarSudhir R. GhorpadeYoung tableaux and linear independence of standard monomials in multiminors of a multimatrix.Discret. Math.9611-321991Journal Articlesopenjournals/dm/AbhyankarG9110.1016/0012-365X(91)90467-Ghttps://doi.org/10.1016/0012-365X(91)90467-Ghttps://dblp.org/rec/journals/dm/AbhyankarG91URL#6901781Douglas BauerGenghua FanHenk Jan VeldmanHamiltonian properties of graphs with large neighborhood unions.Discret. Math.96133-491991Journal Articlesopenjournals/dm/BauerFV9110.1016/0012-365X(91)90468-Hhttps://doi.org/10.1016/0012-365X(91)90468-Hhttps://dblp.org/rec/journals/dm/BauerFV91URL#6901807Richard A. BrualdiBryan L. ShaderMatrices of 0's and 1's with restricted permanental minors.Discret. Math.963161-1741991Journal Articlesopenjournals/dm/BrualdiS9110.1016/0012-365X(91)90310-Xhttps://doi.org/10.1016/0012-365X(91)90310-Xhttps://dblp.org/rec/journals/dm/BrualdiS91URL#6901822Sheshayya A. ChoudumOn forcibly connected graphic sequences.Discret. Math.963175-1811991Journal Articlesopenjournals/dm/Choudum91a10.1016/0012-365X(91)90311-Ohttps://doi.org/10.1016/0012-365X(91)90311-Ohttps://dblp.org/rec/journals/dm/Choudum91aURL#6901843Roberto CignoliQuantifiers on distributive lattices.Discret. Math.963183-1971991Journal Articlesopenjournals/dm/Cignoli9110.1016/0012-365X(91)90312-Phttps://doi.org/10.1016/0012-365X(91)90312-Phttps://dblp.org/rec/journals/dm/Cignoli91URL#6901844Pierre HansenJulio KuplinskyThe smallest hard-to-color graph.Discret. Math.963199-2121991Journal Articlesopenjournals/dm/HansenK9110.1016/0012-365X(91)90313-Qhttps://doi.org/10.1016/0012-365X(91)90313-Qhttps://dblp.org/rec/journals/dm/HansenK91URL#6901908Michael D. HendyA combinatorial description of the closest tree algorithm for finding evolutionary trees.Discret. Math.96151-581991Journal Articlesopenjournals/dm/Hendy9110.1016/0012-365X(91)90469-Ihttps://doi.org/10.1016/0012-365X(91)90469-Ihttps://dblp.org/rec/journals/dm/Hendy91URL#6901921Derek A. HoltonDingjun LouMichael D. PlummerOn the 2-extendability of planar graphs.Discret. Math.96281-991991Journal Articlesopenjournals/dm/HoltonLP9110.1016/0012-365X(91)90227-Shttps://doi.org/10.1016/0012-365X(91)90227-Shttps://dblp.org/rec/journals/dm/HoltonLP91URL#6901929Ferenc JuhászThe asymptotic behaviour of Fiedler's algebraic connectivity for random graphs.Discret. Math.96159-631991Journal Articlesopenjournals/dm/Juhasz9110.1016/0012-365X(91)90470-Mhttps://doi.org/10.1016/0012-365X(91)90470-Mhttps://dblp.org/rec/journals/dm/Juhasz91URL#6901943Khee Meng KohChung-Piaw TeoThe chromatic uniqueness of certain broken wheels.Discret. Math.96165-691991Journal Articlesopenjournals/dm/KohT9110.1016/0012-365X(91)90471-Dhttps://doi.org/10.1016/0012-365X(91)90471-Dhttps://dblp.org/rec/journals/dm/KohT91URL#6901956Earl S. KramerQiu-Rong WuSpyros S. MagliverasTran van TrungSome perpendicular arrays for arbitrarily large t.Discret. Math.962101-1101991Journal Articlesopenjournals/dm/KramerWMT9110.1016/0012-365X(91)90228-Thttps://doi.org/10.1016/0012-365X(91)90228-Thttps://dblp.org/rec/journals/dm/KramerWMT91URL#6901962Antoni MarczykZdzislaw SkupienMaximum nonhamiltonian tough graphs.Discret. Math.963213-2201991Journal Articlesopenjournals/dm/MarczykS9110.1016/0012-365X(91)90314-Rhttps://doi.org/10.1016/0012-365X(91)90314-Rhttps://dblp.org/rec/journals/dm/MarczykS91URL#6901990Harald NiederreiterA combinatorial problem for vector spaces over finite fields.Discret. Math.963221-2281991Journal Articlesopenjournals/dm/Niederreiter9110.1016/0012-365X(91)90315-Shttps://doi.org/10.1016/0012-365X(91)90315-Shttps://dblp.org/rec/journals/dm/Niederreiter91URL#6902013Rajendra M. PawaleSharad S. SaneA short proof of a conjecture on quasi-symmetric 3-designs.Discret. Math.96171-741991Journal Articlesopenjournals/dm/PawaleS9110.1016/0012-365X(91)90472-Ehttps://doi.org/10.1016/0012-365X(91)90472-Ehttps://dblp.org/rec/journals/dm/PawaleS91URL#6902018Robert E. PeileInclusion transformations: (n, m)-graphs and their classification.Discret. Math.962111-1291991Journal Articlesopenjournals/dm/Peile9110.1016/0012-365X(91)90229-Uhttps://doi.org/10.1016/0012-365X(91)90229-Uhttps://dblp.org/rec/journals/dm/Peile91URL#6902019Jerzy ToppLutz VolkmannOn graphs with equal domination and independent domination numbers.Discret. Math.96175-801991Journal Articlesopenjournals/dm/ToppV9110.1016/0012-365X(91)90473-Fhttps://doi.org/10.1016/0012-365X(91)90473-Fhttps://dblp.org/rec/journals/dm/ToppV91URL#6902090Jerzy ToppLutz VolkmannOn packing and covering numbers of graphs.Discret. Math.963229-2381991Journal Articlesopenjournals/dm/ToppV91a10.1016/0012-365X(91)90316-Thttps://doi.org/10.1016/0012-365X(91)90316-Thttps://dblp.org/rec/journals/dm/ToppV91aURL#6902091Lorenzo TraldiGeneralized activities and K-terminal reliability.Discret. Math.962131-1491991Journal Articlesopenjournals/dm/Traldi9110.1016/0012-365X(91)90230-Yhttps://doi.org/10.1016/0012-365X(91)90230-Yhttps://dblp.org/rec/journals/dm/Traldi91URL#6902092Cun-Quan ZhangYongjin ZhuLong path connectivity of regular graphs.Discret. Math.962151-1601991Journal Articlesopenjournals/dm/ZhangZ9110.1016/0012-365X(91)90231-Phttps://doi.org/10.1016/0012-365X(91)90231-Phttps://dblp.org/rec/journals/dm/ZhangZ91URL#6902119