default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 89
Volume 89, October 2008
- Bolian Liu, Xiankun Zhang:
Wide Diameters and Diameter of Networks. Ars Comb. 89 (2008) - Yunqing Zhang:
On Ramsey Numbers of Short Paths versus Large Wheels. Ars Comb. 89 (2008) - Zoran Stojakovic, Mila Stojakovic:
On Sets of Orthogonal d-Cubes. Ars Comb. 89 (2008) - Emrah Kiliç, Dursun Tasci:
On Families of Bipartite Graphs Associated with Sums of Fibonacci and Lucas Numbers. Ars Comb. 89 (2008) - Nick C. Fiala:
l-Designs with Two Block Sizes. Ars Comb. 89 (2008) - Haiyan Wang, Yanxun Chang:
(K3+e, lambda)-group divisible designs of type gtu1. Ars Comb. 89 (2008) - Meijie Ma, Jun-Ming Xu:
Weakly Edge-Pancyclicity of Locally Twisted Cubes. Ars Comb. 89 (2008) - Adrian Kosowski, Pawel Zylinski:
Packing Three-Vertex Paths in 2-Connected Cubic Graphs. Ars Comb. 89 (2008) - Amir Daneshgar, Hossein Hajiabolhassan, Navid Hamedazimi:
On Connected Colourings of Graphs. Ars Comb. 89 (2008) - Stephan G. Wagner:
Subset Counting in Trees. Ars Comb. 89 (2008) - Jingjing Chen, Elaine M. Eschen, Hong-Jian Lai:
Group connectivity of certain graphs. Ars Comb. 89 (2008) - Michael A. Henning, Justin Southey:
A note on graphs with disjoint dominating and total dominating sets. Ars Comb. 89 (2008) - Baoyindureng Wu, Li Zhang:
Disproof of a Conjecture on List Coloring. Ars Comb. 89 (2008) - Konstantinos Drakakis:
Three challenges in Costas arrays. Ars Comb. 89 (2008) - Haiying Wang, Liang Sun:
New results on the eccentric digraphs of the digraphs. Ars Comb. 89 (2008) - Muhammad Akram:
(epsilon, epsilon ^ q)-Fuzzy ideals of K-algebras. Ars Comb. 89 (2008) - Manouchehr Zaker:
Greedy Defining Sets in Latin Squares. Ars Comb. 89 (2008) - Fernanda Pambianco, Leo Storme:
Minimal blocking sets in PG(2, 9). Ars Comb. 89 (2008) - Jiansheng Cai, Guizhen Liu:
Stability Number and f-factor in K1, n-free Graphs. Ars Comb. 89 (2008) - Allan D. Mills:
On the Co-circuits of a Splitting Matroid. Ars Comb. 89 (2008) - Yuan Sun, Hao Shen:
New Binary Sequences of Length 4p with Optimal Autocorrelation Magnitude. Ars Comb. 89 (2008) - H. Doostie, Mohammad Maghasedi:
Certain classes of groups with commutativity degree d(G) < 1/2. Ars Comb. 89 (2008) - Haci Civciv, Ramazan Turkmen:
Notes on the (s, t)-Lucas and Lucas Matrix Sequences. Ars Comb. 89 (2008) - Mahendra Jani, Melkamu Zeleke:
On Generalizing Motzkin Numbers using k-Trees. Ars Comb. 89 (2008) - David DiMarco:
Realizability of Connected, Separable, p-Point, q-Line Graphs with Prescribed Minimum Degree and Line Connectivity. Ars Comb. 89 (2008) - A. Mahmiani, A. Iranmanesh, Y. Pakravesh:
Szeged Index of armchair polyhex Nanotube. Ars Comb. 89 (2008) - Ralph Grimaldi:
Ternary Strings with no Consecutive 1's. Ars Comb. 89 (2008) - Mao Peng, Hao Shen:
Generalized weakly connected domination in graphs. Ars Comb. 89 (2008) - Adrian Melekoglu:
A Geometric Approach to the Reflections of Regular Maps. Ars Comb. 89 (2008) - Olof Heden, Stefano Marcugini, Fernanda Pambianco, Leo Storme:
On the non-existence of a maximal partial spread of size 76 in PG(3, 9). Ars Comb. 89 (2008) - Philip A. Sinclair:
Upon the existence of a removable circuit in a simple 3-connected Eularian graphs. Ars Comb. 89 (2008) - Arnold Knopfmacher, Neville Robbins:
On Multi-Color Partitions with Distinct Parts. Ars Comb. 89 (2008) - Nicholas A. Loehr, Bruce E. Sagan, Gregory S. Warrington:
A human proof for a generalization of Shalosh B. Ekhad's 10n Lattice Paths Theorem. Ars Comb. 89 (2008) - Guoping Wang, Qiongxiang Huang, Jing Cai:
On the spectral radius of graphs with k-vertex cut. Ars Comb. 89 (2008)
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-26 00:57 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:
