default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 56
Volume 56, July 2000
- T. Aaron Gulliver, Masaaki Harada:
Double Circulant Self-Dual Codes over GF(5). Ars Comb. 56 (2000) - Pranava K. Jha:
Further Results on Independence in Direct-Product Graphs. Ars Comb. 56 (2000) - Hikoe Enomoto, Kayo Masuda, Tomoki Nakamigawa:
Induced Graph Theorem on Magic Valuations. Ars Comb. 56 (2000) - Ingrid Mengersen, Jörg Oeckermann:
Ramsey Sets for Matchings. Ars Comb. 56 (2000) - Edy Tri Baskoro, Mirka Miller, Ján Plesník:
Further results on almost Moore digraphs. Ars Comb. 56 (2000) - Daphne Der-Fen Liu:
T-Colorings and Chromatic Number of Distance Graphs. Ars Comb. 56 (2000) - Philip Maynard:
Square-celled animal reconstruction problems. Ars Comb. 56 (2000) - Terry A. McKee:
Dimensions for Cographs. Ars Comb. 56 (2000) - Nancy E. Clarke, Richard J. Nowakowski:
Cops, Robber, and Photo Radar. Ars Comb. 56 (2000) - T. Aaron Gulliver, Patric R. J. Östergård:
New Binary Linear Codes. Ars Comb. 56 (2000) - Dong Geon Kim, Sang Geun Hahn, Yong Soo Kim:
A Syndrome-Distribution Decoding of Mols Lp Codes. Ars Comb. 56 (2000) - Liying Kang, Erfang Shan:
Lower bounds on dominating functions in graphs. Ars Comb. 56 (2000) - Gregory F. Bachelis, Troy Barcume, Xiang-Ying Su:
On the Decomposition of Graphs Into Cliques. Ars Comb. 56 (2000) - B. J. Vowden:
A new infinite series of double Youden rectangles. Ars Comb. 56 (2000) - Margaret H. Forbush, Elizabeth Hanson, Susan Kim, Andrew Mauer-Oats, Rhian Merris, Jennifer Oats-Sargent, Seth Oldham, Kate Sharkey, Dave Witte:
Hamiltonian Paths in Projective Checkerboards. Ars Comb. 56 (2000) - Teresa W. Haynes, Michael A. Henning:
The domatic numbers of factors of graphs. Ars Comb. 56 (2000) - Saad I. El-Zanati, Charles Vanden Eynden:
On Graphs with Strong a-valuations. Ars Comb. 56 (2000) - Yair Caro, Yehuda Roditty:
Improved bounds for the product of the domination and chromatic numbers of a graph. Ars Comb. 56 (2000) - M. H. Armanious:
Nilpotent-SQS-Skeins with Nilpotent Derived Sloops. Ars Comb. 56 (2000) - Changwoo Lee:
The Expectation of Independent Domination Number Over Random Binary Trees. Ars Comb. 56 (2000) - Francesc Aguiló, J. Gonzalez, Ester Simó, Marisa Zaragozá:
Broadcasting in Odd Graphs. Ars Comb. 56 (2000) - Gregory P. Tollisen, Tamás Lengyel:
Color Switching Games. Ars Comb. 56 (2000) - T. Aaron Gulliver, Vijay K. Bhargava:
Some Nonbinary Power Residue Codes. Ars Comb. 56 (2000) - Christian Lopez, Ute A. Mueller:
The mapping C: G -> C(G), a new graph theoretic map. Ars Comb. 56 (2000) - Bolian Liu, Wang Yan:
The kth Lower Multiexponent of Tournament Matrices. Ars Comb. 56 (2000) - Ladislav Stacho:
Cycles through specified vertices in 1-tough graphs. Ars Comb. 56 (2000) - Daniel K. Biss:
On the Symmetry Groups of Hypergraphs of Perfect Cwatsets. Ars Comb. 56 (2000) - Salar Y. Alsardary:
Covering the Powers of the Complete Graph with a Bounded Number of Snakes. Ars Comb. 56 (2000) - Peter Adams, Darryn E. Bryant, Abdollah Khodkar:
The fine structure of balanced ternary designs with block size three, index three and rho2 = 1, 2. Ars Comb. 56 (2000) - Sindi Sabourin:
Large Neighbourhood Unions and Edge-disjoint Perfect Matchings. Ars Comb. 56 (2000)
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.
last updated on 2025-02-21 19:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
