Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/dm/dm19.bht:"
@article{DBLP:journals/dm/AlspachR77, author = {Brian Alspach and Moshe Rosenfeld}, title = {On embedding triangle-free graphs in unit spheres}, journal = {Discret. Math.}, volume = {19}, number = {2}, pages = {103--111}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90026-7}, doi = {10.1016/0012-365X(77)90026-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/AlspachR77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Bannai77, author = {Eiichi Bannai}, title = {Examples of groups which have a graphical regular representation}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {287--288}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90109-1}, doi = {10.1016/0012-365X(77)90109-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Bannai77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BermondS77, author = {Jean{-}Claude Bermond and Johanan Sch{\"{o}}nheim}, title = {G-decomposition of K\({}_{\mbox{n}}\), where {G} has four vertices or less}, journal = {Discret. Math.}, volume = {19}, number = {2}, pages = {113--120}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90027-9}, doi = {10.1016/0012-365X(77)90027-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BermondS77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BlairJ77, author = {Charles E. Blair and Robert G. Jeroslow}, title = {The value function of a mixed integer program: {I}}, journal = {Discret. Math.}, volume = {19}, number = {2}, pages = {121--138}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90028-0}, doi = {10.1016/0012-365X(77)90028-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BlairJ77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BondyT77, author = {J. Adrian Bondy and Carsten Thomassen}, title = {A short proof of Meyniel's theorem}, journal = {Discret. Math.}, volume = {19}, number = {2}, pages = {195--197}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90034-6}, doi = {10.1016/0012-365X(77)90034-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BondyT77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Brown77, author = {David P. Brown}, title = {Compound and unimodular matrices}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {1--5}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90114-5}, doi = {10.1016/0012-365X(77)90114-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Brown77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Cunningham77, author = {W. H. Cunningham}, title = {Chords and disjoint paths in matroids}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {7--15}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90115-7}, doi = {10.1016/0012-365X(77)90115-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Cunningham77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Czerniakiewicz77, author = {A. Czerniakiewicz}, title = {Minimal graphs with cyclic color group}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {201--212}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90100-5}, doi = {10.1016/0012-365X(77)90100-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Czerniakiewicz77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DuffusR77, author = {Dwight Duffus and Ivan Rival}, title = {Path length in the covering graph of a lattice}, journal = {Discret. Math.}, volume = {19}, number = {2}, pages = {139--158}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90029-2}, doi = {10.1016/0012-365X(77)90029-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/DuffusR77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Edmonds77, author = {Frances Chevarley Edmonds}, title = {Rectangular arrays}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {213--227}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90101-7}, doi = {10.1016/0012-365X(77)90101-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Edmonds77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ErdosM77, author = {Paul Erd{\"{o}}s and Amram Meir}, title = {On total matching numbers and total covering numbers of complementary graphs}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {229--233}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90102-9}, doi = {10.1016/0012-365X(77)90102-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ErdosM77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Fagin77, author = {Ronald Fagin}, title = {The number of finite relational structures}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {17--21}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90116-9}, doi = {10.1016/0012-365X(77)90116-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Fagin77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Gavril77, author = {Fanica Gavril}, title = {Algorithms on clique separable graphs}, journal = {Discret. Math.}, volume = {19}, number = {2}, pages = {159--165}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90030-9}, doi = {10.1016/0012-365X(77)90030-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Gavril77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Goldstine77, author = {Jonathan Goldstine}, title = {A simplified proof of Parikh's theorem}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {235--239}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90103-0}, doi = {10.1016/0012-365X(77)90103-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Goldstine77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/GoodC77, author = {I. J. Good and J. F. Crook}, title = {The enumeration of arrays and a generalization related to contingency tables}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {23--45}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90117-0}, doi = {10.1016/0012-365X(77)90117-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/GoodC77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Hechler77, author = {Stephen H. Hechler}, title = {On infinite graphs with a specified number of colorings}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {241--255}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90104-2}, doi = {10.1016/0012-365X(77)90104-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Hechler77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HwangL77, author = {Frank K. Hwang and J. C. Lagarias}, title = {Minimum range sequences of all k-subsets of a set}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {257--264}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90105-4}, doi = {10.1016/0012-365X(77)90105-4}, timestamp = {Fri, 01 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/HwangL77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Johnson77, author = {Diane Johnson}, title = {A (2, 11) combinatorial groupoid}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {265--271}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90106-6}, doi = {10.1016/0012-365X(77)90106-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Johnson77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Katchalski77, author = {Meir Katchalski}, title = {Intersecting all edges of convex polytopes by planes}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {273--279}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90107-8}, doi = {10.1016/0012-365X(77)90107-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Katchalski77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Klove77a, author = {Torleiv Kl{\o}ve}, title = {The modular n-queen problem}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {289--291}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90110-8}, doi = {10.1016/0012-365X(77)90110-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Klove77a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Krogdahl77, author = {Stein Krogdahl}, title = {The dependence graph for bases in matroids}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {47--59}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90118-2}, doi = {10.1016/0012-365X(77)90118-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Krogdahl77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Kung77, author = {Joseph P. S. Kung}, title = {The core extraction axiom for combinatorial geometries}, journal = {Discret. Math.}, volume = {19}, number = {2}, pages = {167--175}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90031-0}, doi = {10.1016/0012-365X(77)90031-0}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/Kung77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Lesniak-Foster77, author = {Linda M. Lesniak{-}Foster}, title = {A note on stable graphs}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {93--97}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90123-6}, doi = {10.1016/0012-365X(77)90123-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Lesniak-Foster77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/MatthewsO77, author = {Laurence R. Matthews and James G. Oxley}, title = {Infinite graphs and bicircular matroids}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {61--65}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90119-4}, doi = {10.1016/0012-365X(77)90119-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/MatthewsO77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/McCarthyV77, author = {David McCarthy and Scott A. Vanstone}, title = {Embedding (r, 1)-designs in finite projective planes}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {67--76}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90120-0}, doi = {10.1016/0012-365X(77)90120-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/McCarthyV77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Megiddo77, author = {Nimrod Megiddo}, title = {Mixtures of order matrices and generalized order matrices}, journal = {Discret. Math.}, volume = {19}, number = {2}, pages = {177--181}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90032-2}, doi = {10.1016/0012-365X(77)90032-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Megiddo77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/MillerF77, author = {Michael D. Miller and Richard J. Friedlander}, title = {On some sequencing problems in finite groups}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {77--84}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90121-2}, doi = {10.1016/0012-365X(77)90121-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/MillerF77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Riviere77, author = {Michel Riviere}, title = {Amas dans les graphes planaires}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {281--286}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90108-X}, doi = {10.1016/0012-365X(77)90108-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Riviere77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Strehl77, author = {Volker Strehl}, title = {A note on similarity relations}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {99--101}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90124-8}, doi = {10.1016/0012-365X(77)90124-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Strehl77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/StrohleinZ77, author = {Thomas Str{\"{o}}hlein and L. Zagler}, title = {Analyzing games by Boolean matrix iteration}, journal = {Discret. Math.}, volume = {19}, number = {2}, pages = {183--193}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90033-4}, doi = {10.1016/0012-365X(77)90033-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/StrohleinZ77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Thomassen77, author = {Carsten Thomassen}, title = {An ore-type condition implying a digraph to be pancyclic}, journal = {Discret. Math.}, volume = {19}, number = {1}, pages = {85--92}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90122-4}, doi = {10.1016/0012-365X(77)90122-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Thomassen77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Thomassen77a, author = {Carsten Thomassen}, title = {Counterexamples to the edge reconstruction conjecture for infinite graphs}, journal = {Discret. Math.}, volume = {19}, number = {3}, pages = {293--295}, year = {1977}, url = {https://doi.org/10.1016/0012-365X(77)90111-X}, doi = {10.1016/0012-365X(77)90111-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Thomassen77a.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.