default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 61
Volume 61, September 2001
- Camino Balbuena, Ángeles Carmona:
On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs. Ars Comb. 61 (2001) - Yoshimi Egawa, Katsuhiro Ota:
Vertex-Disjoint Paths in Graphs. Ars Comb. 61 (2001) - Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley:
Stable and unstable graphs with total irredundance number zero. Ars Comb. 61 (2001) - L. H. Harper:
The Edge-Isoperimetric Problem for Regular Planar Tesselations. Ars Comb. 61 (2001) - Weidong Gao:
On Zero Sum Subsequences of Restricted Size III. Ars Comb. 61 (2001) - Owen D. Byer:
Maximum number of 3-paths in a graph. Ars Comb. 61 (2001) - Adolf Mader, Otto Mutzbauer:
Double Orderings of (0, 1)-Matrices. Ars Comb. 61 (2001) - A. K. Agarwal:
n-Color Analogues of Gaussian Polynomials. Ars Comb. 61 (2001) - Wensong Lin, Zengmin Song:
Neighborhood Union Condition with Distance for Vertex-pancyclicity. Ars Comb. 61 (2001) - Saad I. El-Zanati, Charles Vanden Eynden:
On a-valuations of disconnected graphs. Ars Comb. 61 (2001) - David DiMarco:
Realizability of p-Point, q-Line Graphs with Prescribed Maximum Degree, and Point Connectivity. Ars Comb. 61 (2001) - Tsutomu Anazawa:
Lexicographically Optimum Traffic Trees with Maximum Degree Constraints. Ars Comb. 61 (2001) - Masakazu Nihei:
On the Toughness of the Total Graph of a Graph. Ars Comb. 61 (2001) - Sheshayya A. Choudum, N. Priya:
Tough-Maximum Graphs. Ars Comb. 61 (2001) - Iwao Sato:
Isomorphisms of Cyclic Abelian Covers of Symmetric Digraphs, III. Ars Comb. 61 (2001) - Thomas E. Hall, Charles F. Osborne, Andrew Z. Tirkel:
Families of Matrices with Good Auto and Cross-Correlation. Ars Comb. 61 (2001) - Richard C. Brewster, Gary MacGillivray:
Minimizing b + D and well covered graphs. Ars Comb. 61 (2001) - Haruko Okamura:
2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs. Ars Comb. 61 (2001) - Giorgio Faina, Massimo Giulietti:
Decoding Goppa Codes with MAGMA. Ars Comb. 61 (2001) - Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu:
No-hole 2-distant colorings for unit interval graphs. Ars Comb. 61 (2001) - Giovanni Lo Faro, Antoinette Tripodi:
The intersection problem for twin bowtie and near bowtie systems. Ars Comb. 61 (2001) - Tay-Woei Shyu, Chiang Lin:
Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs. Ars Comb. 61 (2001) - Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
Classification of the [n, 3, n-3]_q NMDS codes over GF(7), GF(8) and GF(9). Ars Comb. 61 (2001) - Parag K. Deb, Nirmala B. Limaye:
Some Families of Elegant and Harmonious Graphs. Ars Comb. 61 (2001) - Peter Adams, Abdollah Khodkar:
Smallest weak and smallest totally weak critical set in the latin squares of order at most seven. Ars Comb. 61 (2001) - Rajender Parsad, V. K. Gupta:
Balanced Bipartite Row-Column Designs. Ars Comb. 61 (2001) - Robert B. Gardner:
Cyclic and Rotational Decompositions of K_n into Stars. Ars Comb. 61 (2001)
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-20 00: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:
