Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 87
Volume 87, April 2008
- Sang-Gu Lee, Han-Guk Seol, Jeong-Mo Yang:
Bound For 2-Exponents of Primitive Extremal Tournaments. Ars Comb. 87 (2008) - Peter D. Johnson Jr., Matt Walsh:
Fractional inverse and inverse fractional domination. Ars Comb. 87 (2008) - Lifeng Ou:
Critically and Minimally Cochromatic Graphs. Ars Comb. 87 (2008) - Zhongfu Zhang, Pengxiang Qiu, Baogen Xu, Jingwen Li, Xiangen Chen, Bing Yao:
Vertex-distinguishing total coloring of graphs. Ars Comb. 87 (2008) - Moo Young Sohn, Xudong Yuan:
i?(1)-perfect graphs with girth at least six. Ars Comb. 87 (2008) - John P. McSorley, Philip Feinsilver, René Schott:
Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs. Ars Comb. 87 (2008) - Juan Liu, Jixiang Meng:
Super-Arc-Connected and Super-Connected Total Digraphs. Ars Comb. 87 (2008) - Rodolfo Salvi, Norma Zagaglia Salvi:
Alternating unimodal sequences of Whitney numbers. Ars Comb. 87 (2008) - Ian Anderson, Leigh H. M. Ellison:
Z-Cyclic Directed Moore (2, 6) Generalised Whist Tournament Designs on p elements where p = 7 (mod 12). Ars Comb. 87 (2008) - M. A. Seoud, E. A. El Sakhawi:
On Variations of Graceful Labelings. Ars Comb. 87 (2008) - Zan-Bo Zhang, Dingjun Lou, Xiaoyan Zhang:
Notes on factor-critically, extendability and independence number. Ars Comb. 87 (2008) - A. Panayotopoulos, Panayiotis M. Vlamos:
Meandric polygons. Ars Comb. 87 (2008) - Haci Civciv, Ramazan Turkmen:
On the (s, t)-Fibonacci and Fibonacci Matrix Sequences. Ars Comb. 87 (2008) - Qiuju Bian:
On toughness and fractional f-factors. Ars Comb. 87 (2008) - Hui Cheng, Bing Yao, Xiangen Chen, Zhongfu Zhang:
On Graceful Generalized Spiders and Caterpillars. Ars Comb. 87 (2008) - Lynne L. Doty, Kevin Ferland:
Some Maximally Tough Circulants. Ars Comb. 87 (2008) - K. Reji Kumar, S. Arumugam, Gary MacGillivray:
On Maximal Fractional Independent Sets In Graphs. Ars Comb. 87 (2008) - Zhongfu Zhang, Bing Yao, Jingwen Li, Linzhong Liu, Jianfang Wang, Baogen Xu:
On Incidence Graphs. Ars Comb. 87 (2008) - David DiMarco:
Realizability of Connected, Separable, p-Point, q-Line Graphs with Prescribed Minimum Degree and Line Connectivity. Ars Comb. 87 (2008) - Yueping Li, Dingjun Lou, Yunting Lu:
Algorithms For The Optimal Hamiltonian Path In Halin Graphs. Ars Comb. 87 (2008) - Lane H. Clark, J. P. McSorley:
Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees". Ars Comb. 87 (2008) - Guizhen Liu, Qinglin Yu:
Strongly pan-factorial property in cages. Ars Comb. 87 (2008) - T. N. Janakiraman, M. Bhanumathi, S. Muthammai:
Self-centered super graph of a graph and center number of a graph. Ars Comb. 87 (2008) - Pratima Panigrahi, Debdas Mishra:
Graceful Lobsters Obtained from Diameter Four Trees Using Partitioning Technique. Ars Comb. 87 (2008) - De-Yin Zheng:
Q-Analogue Of The Pascal Matrix. Ars Comb. 87 (2008) - Johannes H. Hattingh, Michael A. Henning:
Restrained Domination Excellent Trees. Ars Comb. 87 (2008) - Yonghui Fan, Yuqin Zhang, Guoyan Ye:
A Cube-Packing Problem. Ars Comb. 87 (2008) - Irene Stella, Lutz Volkmann, Stefan Winzen:
How close to regular must a multipartite tournament be to secure a given path covering number? Ars Comb. 87 (2008) - János Barát, Peter P. Varju:
On square-free edge colorings of graphs. Ars Comb. 87 (2008) - Jun-Ming Xu, Min Lu:
Restricted Edge-Connectivity of de Bruijn Digraphs. Ars Comb. 87 (2008) - Bing Chen, Shenggui Zhang:
A New s3 Type Condition for Heavy Cycles in Weighted Graphs. Ars Comb. 87 (2008) - Landang Yuan, Qingde Kang:
Graph designs for eight graphs with six vertices and eight edges (index >1). Ars Comb. 87 (2008)
a service of 
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-04-18 20:20 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:
