default search action
Search dblp for Publications
export results for "toc:db/journals/dm/dm96.bht:"
@article{DBLP:journals/dm/AbhyankarG91, author = {Shreeram S. Abhyankar and Sudhir R. Ghorpade}, title = {Young tableaux and linear independence of standard monomials in multiminors of a multimatrix}, journal = {Discret. Math.}, volume = {96}, number = {1}, pages = {1--32}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90467-G}, doi = {10.1016/0012-365X(91)90467-G}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/AbhyankarG91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BauerFV91, author = {Douglas Bauer and Genghua Fan and Henk Jan Veldman}, title = {Hamiltonian properties of graphs with large neighborhood unions}, journal = {Discret. Math.}, volume = {96}, number = {1}, pages = {33--49}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90468-H}, doi = {10.1016/0012-365X(91)90468-H}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BauerFV91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BrualdiS91, author = {Richard A. Brualdi and Bryan L. Shader}, title = {Matrices of 0's and 1's with restricted permanental minors}, journal = {Discret. Math.}, volume = {96}, number = {3}, pages = {161--174}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90310-X}, doi = {10.1016/0012-365X(91)90310-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BrualdiS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Choudum91a, author = {Sheshayya A. Choudum}, title = {On forcibly connected graphic sequences}, journal = {Discret. Math.}, volume = {96}, number = {3}, pages = {175--181}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90311-O}, doi = {10.1016/0012-365X(91)90311-O}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Choudum91a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Cignoli91, author = {Roberto Cignoli}, title = {Quantifiers on distributive lattices}, journal = {Discret. Math.}, volume = {96}, number = {3}, pages = {183--197}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90312-P}, doi = {10.1016/0012-365X(91)90312-P}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Cignoli91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HansenK91, author = {Pierre Hansen and Julio Kuplinsky}, title = {The smallest hard-to-color graph}, journal = {Discret. Math.}, volume = {96}, number = {3}, pages = {199--212}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90313-Q}, doi = {10.1016/0012-365X(91)90313-Q}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HansenK91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Hendy91, author = {Michael D. Hendy}, title = {A combinatorial description of the closest tree algorithm for finding evolutionary trees}, journal = {Discret. Math.}, volume = {96}, number = {1}, pages = {51--58}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90469-I}, doi = {10.1016/0012-365X(91)90469-I}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Hendy91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HoltonLP91, author = {Derek A. Holton and Dingjun Lou and Michael D. Plummer}, title = {On the 2-extendability of planar graphs}, journal = {Discret. Math.}, volume = {96}, number = {2}, pages = {81--99}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90227-S}, doi = {10.1016/0012-365X(91)90227-S}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HoltonLP91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Juhasz91, author = {Ferenc Juh{\'{a}}sz}, title = {The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs}, journal = {Discret. Math.}, volume = {96}, number = {1}, pages = {59--63}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90470-M}, doi = {10.1016/0012-365X(91)90470-M}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Juhasz91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KohT91, author = {Khee Meng Koh and Chung{-}Piaw Teo}, title = {The chromatic uniqueness of certain broken wheels}, journal = {Discret. Math.}, volume = {96}, number = {1}, pages = {65--69}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90471-D}, doi = {10.1016/0012-365X(91)90471-D}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KohT91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KramerWMT91, author = {Earl S. Kramer and Qiu{-}Rong Wu and Spyros S. Magliveras and Tran van Trung}, title = {Some perpendicular arrays for arbitrarily large t}, journal = {Discret. Math.}, volume = {96}, number = {2}, pages = {101--110}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90228-T}, doi = {10.1016/0012-365X(91)90228-T}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KramerWMT91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/MarczykS91, author = {Antoni Marczyk and Zdzislaw Skupien}, title = {Maximum nonhamiltonian tough graphs}, journal = {Discret. Math.}, volume = {96}, number = {3}, pages = {213--220}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90314-R}, doi = {10.1016/0012-365X(91)90314-R}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/MarczykS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Niederreiter91, author = {Harald Niederreiter}, title = {A combinatorial problem for vector spaces over finite fields}, journal = {Discret. Math.}, volume = {96}, number = {3}, pages = {221--228}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90315-S}, doi = {10.1016/0012-365X(91)90315-S}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Niederreiter91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/PawaleS91, author = {Rajendra M. Pawale and Sharad S. Sane}, title = {A short proof of a conjecture on quasi-symmetric 3-designs}, journal = {Discret. Math.}, volume = {96}, number = {1}, pages = {71--74}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90472-E}, doi = {10.1016/0012-365X(91)90472-E}, timestamp = {Sun, 19 Jan 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/PawaleS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Peile91, author = {Robert E. Peile}, title = {Inclusion transformations: (n, m)-graphs and their classification}, journal = {Discret. Math.}, volume = {96}, number = {2}, pages = {111--129}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90229-U}, doi = {10.1016/0012-365X(91)90229-U}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Peile91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ToppV91, author = {Jerzy Topp and Lutz Volkmann}, title = {On graphs with equal domination and independent domination numbers}, journal = {Discret. Math.}, volume = {96}, number = {1}, pages = {75--80}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90473-F}, doi = {10.1016/0012-365X(91)90473-F}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ToppV91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ToppV91a, author = {Jerzy Topp and Lutz Volkmann}, title = {On packing and covering numbers of graphs}, journal = {Discret. Math.}, volume = {96}, number = {3}, pages = {229--238}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90316-T}, doi = {10.1016/0012-365X(91)90316-T}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ToppV91a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Traldi91, author = {Lorenzo Traldi}, title = {Generalized activities and K-terminal reliability}, journal = {Discret. Math.}, volume = {96}, number = {2}, pages = {131--149}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90230-Y}, doi = {10.1016/0012-365X(91)90230-Y}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Traldi91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ZhangZ91, author = {Cun{-}Quan Zhang and Yongjin Zhu}, title = {Long path connectivity of regular graphs}, journal = {Discret. Math.}, volume = {96}, number = {2}, pages = {151--160}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90231-P}, doi = {10.1016/0012-365X(91)90231-P}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ZhangZ91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.