Search dblp for Publications

export results for "toc:db/journals/arscom/arscom53.bht:"

 download as .bib file

@article{DBLP:journals/arscom/AcketaM99,
  author       = {Dragan M. Acketa and
                  Vojislav Mudrinski},
  title        = {A family of 4-designs on 38 points},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/AcketaM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/Alfonsin99,
  author       = {Jorge L. Ram{\'{\i}}rez Alfons{\'{\i}}n},
  title        = {Gracefulness of Replicated Paths and Cycles},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Mon, 23 May 2005 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/arscom/Alfonsin99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/AlspachMV99,
  author       = {Brian Alspach and
                  Joy Morris and
                  V. Vilfred},
  title        = {Self-complementary circulant graphs},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/AlspachMV99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/ArakiS99,
  author       = {Toru Araki and
                  Yukio Shibata},
  title        = {Isomorphic factorization of complete bipartite graph into forest},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/ArakiS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/BateR99,
  author       = {John A. Bate and
                  G. H. John van Rees},
  title        = {The Size of the Smallest Strong Critical Set in a Latin Square},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/BateR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/DuW99,
  author       = {Beiliang Du and
                  W. D. Wallis},
  title        = {The Existence of Self-Conjugate Self-Orthogonal Idempotent Diagonal
                  Latin Squares},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/DuW99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/FuR99,
  author       = {Hung{-}Lin Fu and
                  Christopher A. Rodger},
  title        = {Almost Resolvable Directed m-cycle systems: m = 3 (mod 6)},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 26 Jul 2005 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/arscom/FuR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/GaohuaX99,
  author       = {Kong Gaohua and
                  Zhang Xuebin},
  title        = {On the existence of (v, n, 4, l)-IPMD for even l},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/GaohuaX99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/Haile99,
  author       = {Dawit Haile},
  title        = {Bounds on the Size of Critical Edge-Chromatic Graphs},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/Haile99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/Horrocks99,
  author       = {David G. C. Horrocks},
  title        = {On the Number of Dependent Sets in a Connected Graph},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/Horrocks99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/KimberlingS99,
  author       = {Clark Kimberling and
                  Harris S. Shultz},
  title        = {Card Sorting by Dispersions and Fractal Sequences},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/KimberlingS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/KnopfmacherM99,
  author       = {Arnold Knopfmacher and
                  Michael E. Mays},
  title        = {Compositions With m Distinct Parts},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/KnopfmacherM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/KocayS99,
  author       = {William L. Kocay and
                  Ryan Szypowski},
  title        = {The Application of Determining Sets to Projective Configurations},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Fri, 14 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/arscom/KocayS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/Lee99,
  author       = {Jeh Gwon Lee},
  title        = {The Edge Covering Number of Ordered Sets},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/Lee99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/LinLS99,
  author       = {Chiang Lin and
                  Jenq{-}Jong Lin and
                  Tay{-}Woei Shyu},
  title        = {Isomorphic Star Decompositions of Multicrowns and the Power of Cycles},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/LinLS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/MendelsohnS99,
  author       = {Eric Mendelsohn and
                  Nabil Shalaby},
  title        = {On Skolem Labelling of Windmills},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/MendelsohnS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/Naslund99,
  author       = {Mats N{\"{a}}slund},
  title        = {On Steiner Triple Systems and Perfect Codes},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/Naslund99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/PhelpsY99,
  author       = {Kevin T. Phelps and
                  Carol Yin},
  title        = {Generalized Steiner Systems With Block Size Three and Group Size Four},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/PhelpsY99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/Porter99,
  author       = {Thomas Dale Porter},
  title        = {Minimal Partitions of a Graph},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/Porter99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/RainesR99,
  author       = {Michael Edwin Raines and
                  Christopher A. Rodger},
  title        = {Embedding Partial Extended Triple Systems when l {\textgreater}= 2},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 26 Jul 2005 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/arscom/RainesR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/ReesSWR99,
  author       = {Rolf S. Rees and
                  Douglas R. Stinson and
                  Ruizhong Wei and
                  G. H. John van Rees},
  title        = {An application of covering designs: determining the maximum consistent
                  set of shares in a threshold scheme},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Mon, 26 Jul 2004 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/arscom/ReesSWR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/Roddy99,
  author       = {Michael S. Roddy},
  title        = {A note on orders with level diagrams},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/Roddy99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/Salwach99,
  author       = {Chester J. Salwach},
  title        = {Codes of C(n, n, 1) Designs},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/Salwach99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/StreetS99,
  author       = {Deborah J. Street and
                  Anne Penfold Street},
  title        = {But where are designs used?},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/StreetS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/Webb99,
  author       = {Bridget S. Webb},
  title        = {Infinite designs with more point orbits than block orbits},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/Webb99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/ZhangZ99,
  author       = {Heping Zhang and
                  Fuji Zhang},
  title        = {Block Graphs of Z-transformation Graphs of Perfect Matchings of Plane
                  Elementary Bipartite Graphs},
  journal      = {Ars Comb.},
  volume       = {53},
  year         = {1999},
  timestamp    = {Tue, 06 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/ZhangZ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.