default search action
Search dblp for Publications
export results for "toc:db/journals/dm/dm260.bht:"
@article{DBLP:journals/dm/AlvesC03, author = {Marcelo Muniz Silva Alves and Sueli I. Rodrigues Costa}, title = {Labelings of Lee and Hamming spaces}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {119--136}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00454-5}, doi = {10.1016/S0012-365X(02)00454-5}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/AlvesC03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/AndoE03, author = {Kiyoshi Ando and Yoshimi Egawa}, title = {Maximum number of edges in a critically \emph{k}-connected graph}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {1--25}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00489-2}, doi = {10.1016/S0012-365X(02)00489-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/AndoE03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BerendK03, author = {Daniel Berend and Nimrod Kriger}, title = {On some questions of Razpet regarding binomial coefficients}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {177--182}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00760-4}, doi = {10.1016/S0012-365X(02)00760-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BerendK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BermanZ03, author = {Abraham Berman and Xiao{-}Dong Zhang}, title = {Bipartite density of cubic graphs}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {27--35}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00490-9}, doi = {10.1016/S0012-365X(02)00490-9}, timestamp = {Wed, 27 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/BermanZ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BohmanM03, author = {Tom Bohman and Ryan R. Martin}, title = {A note on G-intersecting families}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {183--188}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00761-6}, doi = {10.1016/S0012-365X(02)00761-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BohmanM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Cieslik03, author = {Dietmar Cieslik}, title = {The Steiner ratio of several discrete metric spaces}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {189--196}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00762-8}, doi = {10.1016/S0012-365X(02)00762-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Cieslik03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/CockayneHM03, author = {Ernest J. Cockayne and Michael A. Henning and Christina M. Mynhardt}, title = {Vertices contained in all or in no minimum total dominating set of a tree}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {37--44}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00447-8}, doi = {10.1016/S0012-365X(02)00447-8}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/CockayneHM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DobryninMP03, author = {Andrey A. Dobrynin and Leonid S. Melnikov and Artem V. Pyatkin}, title = {On 4-chromatic edge-critical regular graphs of high connectivity}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {315--319}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00668-4}, doi = {10.1016/S0012-365X(02)00668-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/DobryninMP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ElzobiL03, author = {Muktar E. Elzobi and Zbigniew Lonc}, title = {Partitioning Boolean lattices into antichains}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {45--55}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00448-X}, doi = {10.1016/S0012-365X(02)00448-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ElzobiL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/FischermannRV03, author = {Miranca Fischermann and Dieter Rautenbach and Lutz Volkmann}, title = {Remarks on the bondage number of planar graphs}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {57--67}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00449-1}, doi = {10.1016/S0012-365X(02)00449-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/FischermannRV03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/FischermannRV03a, author = {Miranca Fischermann and Dieter Rautenbach and Lutz Volkmann}, title = {Maximum graphs with a unique minimum dominating set}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {197--203}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00670-2}, doi = {10.1016/S0012-365X(02)00670-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/FischermannRV03a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/FranklT03, author = {Peter Frankl and Norihide Tokushige}, title = {The game of \emph{n}-times nim}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {205--209}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00667-2}, doi = {10.1016/S0012-365X(02)00667-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/FranklT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/GuanW03, author = {Yuqiang Guan and Kenneth L. Williams}, title = {Profile minimization on triangulated triangles}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {69--76}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00450-8}, doi = {10.1016/S0012-365X(02)00450-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/GuanW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HaynesHS03, author = {Teresa W. Haynes and Michael A. Henning and Peter J. Slater}, title = {Strong equality of domination parameters in trees}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {77--87}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00451-X}, doi = {10.1016/S0012-365X(02)00451-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HaynesHS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Keijsper03, author = {Judith Keijsper}, title = {A Vizing-type theorem for matching forests}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {211--216}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00671-4}, doi = {10.1016/S0012-365X(02)00671-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Keijsper03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Kitaev03, author = {Sergey Kitaev}, title = {Multi-avoidance of generalised patterns}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {89--100}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00452-1}, doi = {10.1016/S0012-365X(02)00452-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Kitaev03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Li03b, author = {Jianxiang Li}, title = {On neighborhood condition for graphs to have [\emph{a, b}]-factors}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {217--221}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00672-6}, doi = {10.1016/S0012-365X(02)00672-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Li03b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Li03c, author = {Qiaoliang Li}, title = {On weights in duadic abelian codes}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {223--230}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00673-8}, doi = {10.1016/S0012-365X(02)00673-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Li03c.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/LuoCF03, author = {Luo Yuan and Wende Chen and Fang{-}Wei Fu}, title = {A new kind of geometric structures determining the chain good weight hierarchies}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {101--117}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00453-3}, doi = {10.1016/S0012-365X(02)00453-3}, timestamp = {Wed, 03 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/LuoCF03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/McKee03c, author = {Terry A. McKee}, title = {Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {231--238}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00674-X}, doi = {10.1016/S0012-365X(02)00674-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/McKee03c.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Meng03, author = {Jixiang Meng}, title = {Optimally super-edge-connected transitive graphs}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {239--248}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00675-1}, doi = {10.1016/S0012-365X(02)00675-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Meng03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Moller03, author = {R{\"{o}}gnvaldur G. M{\"{o}}ller}, title = {Erratum to "Descendants in highly arc transitive digraphs" [Discrete Mathematics 247 {(2002)} 147-157]}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {321}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00759-8}, doi = {10.1016/S0012-365X(02)00759-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Moller03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/PetersonW03, author = {Dale Peterson and Douglas R. Woodall}, title = {Erratum to "Edge-choosability in line-perfect multigraphs" [Discrete Mathematics 202 {(1999)} 191]}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {323--326}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00676-3}, doi = {10.1016/S0012-365X(02)00676-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/PetersonW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Podbrdsky03, author = {Pavel Podbrdsk{\'{y}}}, title = {A bijective proof of an identity for noncrossing graphs}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {249--253}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00677-5}, doi = {10.1016/S0012-365X(02)00677-5}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/Podbrdsky03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/SethuramanS03, author = {G. Sethuraman and P. Selvaraju}, title = {Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {137--149}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00455-7}, doi = {10.1016/S0012-365X(02)00455-7}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/SethuramanS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Teranishi03, author = {Yasuo Teranishi}, title = {The Hoffman number of a graph}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {255--265}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00764-1}, doi = {10.1016/S0012-365X(02)00764-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Teranishi03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/TongL03, author = {Wenwen Tong and Huiling Li}, title = {Solvable block transitive automorphism groups of 2-(v, 5, 1) designs}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {267--273}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00763-X}, doi = {10.1016/S0012-365X(02)00763-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/TongL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Topalova03, author = {Svetlana Topalova}, title = {Classification of Hadamard matrices of order 44 with automorphisms of order 7}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {275--283}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00400-4}, doi = {10.1016/S0012-365X(02)00400-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Topalova03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/WangH03, author = {Shiying Wang and Jianxiu Hao}, title = {The extreme set condition of a graph}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {151--161}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00534-4}, doi = {10.1016/S0012-365X(02)00534-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/WangH03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/WuML03, author = {Jianqiang Wu and Jingzhong Mao and Deying Li}, title = {New types of integral sum graphs}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {163--176}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00456-9}, doi = {10.1016/S0012-365X(02)00456-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/WuML03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Ye03, author = {Miaolin Ye}, title = {Size of \emph{k}-uniform hypergraph with diameter \emph{d}}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {285--293}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00593-9}, doi = {10.1016/S0012-365X(02)00593-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Ye03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/YinL03, author = {Jian{-}Hua Yin and Jiong{-}Sheng Li}, title = {An extremal problem on potentially \emph{K\({}_{\mbox{r, s}}\)}-graphic sequences}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {295--305}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00765-3}, doi = {10.1016/S0012-365X(02)00765-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/YinL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ZhangZ03, author = {Shengyuan Zhang and Jian Zhu}, title = {An improved product construction for large sets of Kirkman triple systems}, journal = {Discret. Math.}, volume = {260}, number = {1-3}, pages = {307--313}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00766-5}, doi = {10.1016/S0012-365X(02)00766-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ZhangZ03.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.