:facetid:toc:\"db/journals/dm/dm69.bht\"OK:facetid:toc:db/journals/dm/dm69.bhtIan Anderson 0001An Erdös-Ko-Rado theorem for multisets.Discret. Math.6911-91988Journal Articlesopenjournals/dm/Anderson8810.1016/0012-365X(88)90172-0https://doi.org/10.1016/0012-365X(88)90172-0https://dblp.org/rec/journals/dm/Anderson88URL#6982234Achim BachemWalter KernOn sticky matroids.Discret. Math.69111-181988Journal Articlesopenjournals/dm/BachemK8810.1016/0012-365X(88)90173-2https://doi.org/10.1016/0012-365X(88)90173-2https://dblp.org/rec/journals/dm/BachemK88URL#6982235Abraham BermanAnton KotzigCross-cloning and antipodal graphs.Discret. Math.692107-1141988Journal Articlesopenjournals/dm/BermanK8810.1016/0012-365X(88)90010-6https://doi.org/10.1016/0012-365X(88)90010-6https://dblp.org/rec/journals/dm/BermanK88URL#6982239Larry J. BrantGary L. MullenA study of frequency cubes.Discret. Math.692115-1211988Journal Articlesopenjournals/dm/BrantM8810.1016/0012-365X(88)90011-8https://doi.org/10.1016/0012-365X(88)90011-8https://dblp.org/rec/journals/dm/BrantM88URL#6982243Thomas H. BrylawskiElaine DieterExchange systems.Discret. Math.692123-1511988Journal Articlesopenjournals/dm/BrylawskiD8810.1016/0012-365X(88)90012-Xhttps://doi.org/10.1016/0012-365X(88)90012-Xhttps://dblp.org/rec/journals/dm/BrylawskiD88URL#6982247Kiran B. ChilakamarriUnit-distance graphs in rational n-spaces.Discret. Math.693213-2181988Journal Articlesopenjournals/dm/Chilakamarri8810.1016/0012-365X(88)90049-0https://doi.org/10.1016/0012-365X(88)90049-0https://dblp.org/rec/journals/dm/Chilakamarri88URL#6982255G. F. ClementsOn multiset k-families.Discret. Math.692153-1641988Journal Articlesopenjournals/dm/Clements8810.1016/0012-365X(88)90013-1https://doi.org/10.1016/0012-365X(88)90013-1https://dblp.org/rec/journals/dm/Clements88URL#6982256Michele ConfortiMonique LaurentA characterization of matroidal systems of inequalities.Discret. Math.692165-1711988Journal Articlesopenjournals/dm/ConfortiL8810.1016/0012-365X(88)90014-3https://doi.org/10.1016/0012-365X(88)90014-3https://dblp.org/rec/journals/dm/ConfortiL88URL#6982261Mark N. EllinghamIsomorphic factorization of r-regular graphs into r parts.Discret. Math.69119-341988Journal Articlesopenjournals/dm/Ellingham8810.1016/0012-365X(88)90174-4https://doi.org/10.1016/0012-365X(88)90174-4https://dblp.org/rec/journals/dm/Ellingham88URL#6982270Graham FarrThe complexity of multicolouring.Discret. Math.693219-2231988Journal Articlesopenjournals/dm/Farr8810.1016/0012-365X(88)90050-7https://doi.org/10.1016/0012-365X(88)90050-7https://dblp.org/rec/journals/dm/Farr88URL#6982277Klaus G. FischerSymmetric polynomials and Hall's theorem.Discret. Math.693225-2341988Journal Articlesopenjournals/dm/Fischer8810.1016/0012-365X(88)90051-9https://doi.org/10.1016/0012-365X(88)90051-9https://dblp.org/rec/journals/dm/Fischer88URL#6982282David C. FisherThe number of triangles in a K4-free graph.Discret. Math.692203-2051988Journal Articlesopenjournals/dm/Fisher8810.1016/0012-365X(88)90021-0https://doi.org/10.1016/0012-365X(88)90021-0https://dblp.org/rec/journals/dm/Fisher88URL#6982283Hortensia Galeana-SánchezA new method to extend kernel-perfect graphs to kernel-perfect critical graphs.Discret. Math.692207-2091988Journal Articlesopenjournals/dm/Galeana-Sanchez8810.1016/0012-365X(88)90022-2https://doi.org/10.1016/0012-365X(88)90022-2https://dblp.org/rec/journals/dm/Galeana-Sanchez88URL#6982293Robert GroneRussell MerrisA bound for the complexity of a simple graph.Discret. Math.69197-991988Journal Articlesopenjournals/dm/GroneM8810.1016/0012-365X(88)90182-3https://doi.org/10.1016/0012-365X(88)90182-3https://dblp.org/rec/journals/dm/GroneM88URL#6982299András GyárfásMichael S. JacobsonLael F. KinchOn a generalization of transitivity for digraphs.Discret. Math.69135-411988Journal Articlesopenjournals/dm/GyarfasJK8810.1016/0012-365X(88)90175-6https://doi.org/10.1016/0012-365X(88)90175-6https://dblp.org/rec/journals/dm/GyarfasJK88URL#6982303Anthony J. W. HiltonPeter D. Johnson Jr.Reverse class critical multigraphs.Discret. Math.693309-3111988Journal Articlesopenjournals/dm/HiltonJ8810.1016/0012-365X(88)90059-3https://doi.org/10.1016/0012-365X(88)90059-3https://dblp.org/rec/journals/dm/HiltonJ88URL#6982312Jennifer D. KeyN. K. A. RostomUnitary designs with regular sets of points.Discret. Math.693235-2391988Journal Articlesopenjournals/dm/KeyR8810.1016/0012-365X(88)90052-0https://doi.org/10.1016/0012-365X(88)90052-0https://dblp.org/rec/journals/dm/KeyR88URL#6982320Khee Meng KohK. S. PohProducts of graphs with their closed-set lattices.Discret. Math.693241-2511988Journal Articlesopenjournals/dm/KohP8810.1016/0012-365X(88)90053-2https://doi.org/10.1016/0012-365X(88)90053-2https://dblp.org/rec/journals/dm/KohP88URL#6982325Robert R. KorfhageA note on quadratic sigma-polynomials.Discret. Math.692195-1961988Journal Articlesopenjournals/dm/Korfhage8810.1016/0012-365X(88)90018-0https://doi.org/10.1016/0012-365X(88)90018-0https://dblp.org/rec/journals/dm/Korfhage88URL#6982327Hong-Jian LaiOn the Hamiltonian index.Discret. Math.69143-531988Journal Articlesopenjournals/dm/Lai8810.1016/0012-365X(88)90176-8https://doi.org/10.1016/0012-365X(88)90176-8https://dblp.org/rec/journals/dm/Lai88URL#6982331Hartmut LaueA graph theoretic proof of the fundamental trace identity.Discret. Math.692197-1981988Journal Articlesopenjournals/dm/Laue8810.1016/0012-365X(88)90019-2https://doi.org/10.1016/0012-365X(88)90019-2https://dblp.org/rec/journals/dm/Laue88URL#6982333Guizhen LiuA lower bound on connectivities of matroid base graphs.Discret. Math.69155-601988Journal Articlesopenjournals/dm/Liu8810.1016/0012-365X(88)90177-Xhttps://doi.org/10.1016/0012-365X(88)90177-Xhttps://dblp.org/rec/journals/dm/Liu88URL#6982336Yongcai LiuConstruction and counting or generalized Boolean functions.Discret. Math.693313-3161988Journal Articlesopenjournals/dm/Liu88a10.1016/0012-365X(88)90060-Xhttps://doi.org/10.1016/0012-365X(88)90060-Xhttps://dblp.org/rec/journals/dm/Liu88aURL#6982337Francesco M. MalvestutoExistence of extensions and product extensions for discrete probability distributions.Discret. Math.69161-771988Journal Articlesopenjournals/dm/Malvestuto8810.1016/0012-365X(88)90178-1https://doi.org/10.1016/0012-365X(88)90178-1https://dblp.org/rec/journals/dm/Malvestuto88URL#6982343P. MarchioroAurora MorganaRossella PetreschiBruno SimeoneAdamant digraphs.Discret. Math.693253-2611988Journal Articlesopenjournals/dm/MarchioroMPS8810.1016/0012-365X(88)90054-4https://doi.org/10.1016/0012-365X(88)90054-4https://dblp.org/rec/journals/dm/MarchioroMPS88URL#6982344Rudolf MathonOn self-complementary strongly regular graphs.Discret. Math.693263-2811988Journal Articlesopenjournals/dm/Mathon8810.1016/0012-365X(88)90055-6https://doi.org/10.1016/0012-365X(88)90055-6https://dblp.org/rec/journals/dm/Mathon88URL#6982345Hirobumi MizunoIwao SatoRamsey numbers for unions of some cycles.Discret. Math.693283-2941988Journal Articlesopenjournals/dm/MizunoS8810.1016/0012-365X(88)90056-8https://doi.org/10.1016/0012-365X(88)90056-8https://dblp.org/rec/journals/dm/MizunoS88URL#6982351Gary L. MullenPolynomial representation of complete sets of mutually orthogonal frequency squares of prime power order.Discret. Math.69179-841988Journal Articlesopenjournals/dm/Mullen8810.1016/0012-365X(88)90179-3https://doi.org/10.1016/0012-365X(88)90179-3https://dblp.org/rec/journals/dm/Mullen88URL#6982352Grattan MurphyRen DingGrünbaum's gap conjecture.Discret. Math.693295-3001988Journal Articlesopenjournals/dm/MurphyD8810.1016/0012-365X(88)90057-Xhttps://doi.org/10.1016/0012-365X(88)90057-Xhttps://dblp.org/rec/journals/dm/MurphyD88URL#6982353Victor Neumann-LaraJorge UrrutiaA combinatorial result on points and circles on the plane.Discret. Math.692173-1781988Journal Articlesopenjournals/dm/Neumann-LaraU8810.1016/0012-365X(88)90015-5https://doi.org/10.1016/0012-365X(88)90015-5https://dblp.org/rec/journals/dm/Neumann-LaraU88URL#6982355Ortrud R. OellermannThe connected cutset connectivity of a graph.Discret. Math.693301-3081988Journal Articlesopenjournals/dm/Oellermann8810.1016/0012-365X(88)90058-1https://doi.org/10.1016/0012-365X(88)90058-1https://dblp.org/rec/journals/dm/Oellermann88URL#6982359Friedrich OttoAn example of a one-relator group that is not a one-relation monoid.Discret. Math.691101-1031988Journal Articlesopenjournals/dm/Otto8810.1016/0012-365X(88)90183-5https://doi.org/10.1016/0012-365X(88)90183-5https://dblp.org/rec/journals/dm/Otto88URL#6982360Erwin PeschProducts of absolute retracts.Discret. Math.692179-1881988Journal Articlesopenjournals/dm/Pesch8810.1016/0012-365X(88)90016-7https://doi.org/10.1016/0012-365X(88)90016-7https://dblp.org/rec/journals/dm/Pesch88URL#6982361Ronald C. ReadA note on the chromatic uniqueness of W10.Discret. Math.6933171988Journal Articlesopenjournals/dm/Read8810.1016/0012-365X(88)90061-1https://doi.org/10.1016/0012-365X(88)90061-1https://dblp.org/rec/journals/dm/Read88URL#6982365A. F. SidorenkoAn infinite permutation without arithmetic progressions.Discret. Math.6922111988Journal Articlesopenjournals/dm/Sidorenko8810.1016/0012-365X(88)90023-4https://doi.org/10.1016/0012-365X(88)90023-4https://dblp.org/rec/journals/dm/Sidorenko88URL#6982378Zsolt TuzaIsomorphism of two infinite-chromatic triangle-free graphs.Discret. Math.691951988Journal Articlesopenjournals/dm/Tuza8810.1016/0012-365X(88)90181-1https://doi.org/10.1016/0012-365X(88)90181-1https://dblp.org/rec/journals/dm/Tuza88URL#6982384Chengde WangOn the sum of two parameters concerning independence and irredundance in a graph.Discret. Math.692199-2021988Journal Articlesopenjournals/dm/Wang8810.1016/0012-365X(88)90020-9https://doi.org/10.1016/0012-365X(88)90020-9https://dblp.org/rec/journals/dm/Wang88URL#6982389Shao-Ji XuOn sigma-polynomials.Discret. Math.692189-1941988Journal Articlesopenjournals/dm/Xu8810.1016/0012-365X(88)90017-9https://doi.org/10.1016/0012-365X(88)90017-9https://dblp.org/rec/journals/dm/Xu88URL#6982393Bing ZhouThe maximum number of cycles in the complement of a tree.Discret. Math.69185-941988Journal Articlesopenjournals/dm/Zhou8810.1016/0012-365X(88)90180-Xhttps://doi.org/10.1016/0012-365X(88)90180-Xhttps://dblp.org/rec/journals/dm/Zhou88URL#6982395