default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 49
Volume 49, August 1998
- Alfredo García Olaverri, Javier Tejel:
A Lower Bound for the Number of Polygonizations of N Points in the Plane. Ars Comb. 49 (1998) - Suzanne M. Seager:
Cyclic Niche Graphs and Grids. Ars Comb. 49 (1998) - Guantao Chen, Ralph J. Faudree, Warren E. Shreve:
Note on Whitney's Theorem for k-connected Graphs. Ars Comb. 49 (1998) - Mark B. Beintema, Jeffrey T. Bonn, Robert W. Fitzgerald, Joseph L. Yucas:
Orderings of Finite Fields and Balanced Tournaments. Ars Comb. 49 (1998) - José Gómez, M. Escudero:
Edge-Colorings of Some Large Graphs on Alphabets. Ars Comb. 49 (1998) - Yair Caro:
On graphs determined by their k-subgraphs. Ars Comb. 49 (1998) - Stephen C. Locke:
Further Notes on: Largest Triangle-free Subgraphs in Powers of Cycles. Ars Comb. 49 (1998) - Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Scenic Graphs I: Traceable Graphs. Ars Comb. 49 (1998) - Xavier Muñoz, José Gómez:
Asymptotically Optimal (D, D', s)-Digraphs. Ars Comb. 49 (1998) - Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar:
Obstruction Sets for Outer-Projective-Planar Graphs. Ars Comb. 49 (1998) - Frans J. Faase:
On the number of specific spanning subgraphs of the graphs G x Pn. Ars Comb. 49 (1998) - Jennifer J. Quinn, Eric Lars Sundberg:
Strong Chromatic Index in Subset Graphs. Ars Comb. 49 (1998) - Margaret Ann Francel, David J. John:
Counting Balanced Ternary Designs. Ars Comb. 49 (1998) - Suqin Ao, Denis Hanson:
Score Vectors and Tournaments with Cyclic Chromatic Number 1 or 2. Ars Comb. 49 (1998) - Lisa R. Markus, Douglas F. Rall:
On Seed Graphs with Two Components. Ars Comb. 49 (1998) - Johannes H. Hattingh, Renu C. Laskar:
On weak domination in graphs. Ars Comb. 49 (1998) - Margaret Ann Francel, Dinesh G. Sarvate:
One and Two-Block Configurations in Balanced Ternary Designs. Ars Comb. 49 (1998) - Atsushi Kaneko, Mamoru Watanabe:
String Decompositions of Graphs. Ars Comb. 49 (1998) - Saad I. El-Zanati, Michael Plantholt, Charles Vanden Eynden:
Graph Decompositions into Generalized Cubes. Ars Comb. 49 (1998) - Robert B. Gardner:
Bicyclic Directed Triple Systems. Ars Comb. 49 (1998) - Roger Logan, Mithilesh Kumar Singh, Kishore Sinha:
Two Series of BIB Designs. Ars Comb. 49 (1998) - E. Gocka, Walter W. Kirchherr, Edward F. Schmeichel:
A Note on the Road-Coloring Conjecture. Ars Comb. 49 (1998) - Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
Independence and Irredundance in k-Regular Graphs. Ars Comb. 49 (1998) - Weidong Gao, Hongquan Yu:
Note on the Union-Closed Sets Conjecture. Ars Comb. 49 (1998) - Dieter Olpp:
A Lower Bound for the Ramsey Multiplicity of K4. Ars Comb. 49 (1998) - Xueliang Li:
On the Determination Problem for P3-Transformation of Graphs. Ars Comb. 49 (1998) - Abdelhafid Berrachedi, Michel Mollard:
On two problems about (0, 2)-graphs and interval-regular graphs. Ars Comb. 49 (1998) - Ali A. Ali, Khidir Sharaf:
Average Distance in Weighted Graphs with Removed Edges. Ars Comb. 49 (1998) - Yusheng Li, Cecil C. Rousseau:
A Ramsey Goodness Result for Graphs with Many Pendant Edges. Ars Comb. 49 (1998)
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 2024-09-25 00:46 CEST 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:
