default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 69
Volume 69, October 2003
- Akira Saito, Tomoki Yamashita:
A Note on Dominating Cycles in Tough Graphs. Ars Comb. 69 (2003) - Shung-Liang Wu:
New Families of Sequential Graphs. Ars Comb. 69 (2003) - Alois Panholzer:
The Height Distribution of Nodes in Non-Crossing Trees. Ars Comb. 69 (2003) - Garth Isaak, Kathryn L. Nyman, Ann N. Trenk:
A Hierarchy of Classes of Bounded Bitolerance Orders. Ars Comb. 69 (2003) - Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela:
Complete bipartite free graphs. Ars Comb. 69 (2003) - Phyllis Z. Chinn, Ralph Grimaldi, Silvia Heubach:
The Frequency of Summands of a Particular Size in Palindromic Compositions. Ars Comb. 69 (2003) - Stelios Georgiou, Christos Koukouvinos:
On equivalence of Hadamard matrices and projection properties. Ars Comb. 69 (2003) - William Edwin Clark, Mourad E. H. Ismail, Stephen Suen:
Application of Upper and Lower Bounds for the Domination Number to Vizing's Conjecture. Ars Comb. 69 (2003) - A. Panayotopoulos, Aristidis Sapounakis:
On Motzkin words and noncrossing partitions. Ars Comb. 69 (2003) - Ian D. Gray, Jim A. MacDougall, R. J. Simpson, Walter D. Wallis:
Vertex-Magic Total Labelings of Complete Bipartite Graphs. Ars Comb. 69 (2003) - Mohammed M. M. Jaradat:
On The Hamiltonian Decomposition of Special Product of Graphs. Ars Comb. 69 (2003) - James A. Sellers:
Parity Results for p-Regular Partitions with Distinct Parts. Ars Comb. 69 (2003) - Sheng Bau, Michael A. Henning, Peter Dankelmann:
Average lower independence in trees and outerplanar graphs. Ars Comb. 69 (2003) - Tomoki Nakamigawa:
A Note on the Decomposition Dimension of Complete Graphs. Ars Comb. 69 (2003) - Clark Kimberling:
A Run-length Operator on Partitions of Integers, Applied to Inventory Chains. Ars Comb. 69 (2003) - Daphne Der-Fen Liu, Xuding Zhu:
Circulant Distant Two Labeling and Circular Chromatic Number. Ars Comb. 69 (2003) - Frank Rubin:
Improved Knight Coverings. Ars Comb. 69 (2003) - Mike J. Grannell, Terry S. Griggs, Kathleen A. S. Quinn, Barbara M. Maenhaut, Ralph Gordon Stanton:
More on exact bicoverings of 12 points. Ars Comb. 69 (2003) - Masakazu Nihei:
Algebraic connectivity of the line graph, the middle graph and the total graph of a regular graph. Ars Comb. 69 (2003) - Dingjun Lou, Akira Saito, Lihua Teng:
To Determine 1-Extendable Graphs and its Algorithm. Ars Comb. 69 (2003) - Erfang Shan, Moo Young Sohn, Liying Kang:
Upper bounds on signed 2-independence number of graphs. Ars Comb. 69 (2003) - V. Swaminathan, P. Thangaraju:
Phi-Strong (weak) domination in a graph. Ars Comb. 69 (2003) - Kenneth J. Roblee:
Triangle-Free Regular Graphs as an Extremal Family. Ars Comb. 69 (2003) - David C. Fisher:
On the n x n Knight Cover Problem. Ars Comb. 69 (2003) - Stephen G. Hartke, Aparna W. Higgins:
Minimum Degree Growth of the Iterated Line Graph. Ars Comb. 69 (2003) - Eduardo Sany Laber, Emerson L. Monte Carmelo:
A Note on multicolor bipartite Ramsey numbers for K_{2, n}. Ars Comb. 69 (2003) - Michael Minic, Rebecca Calahan Zijlstra:
Steiner Triple Systems with Automorphism Type [1, 0, 0, 0, 0, 0, 0, t, 0, ...0, 1, 0, ...0]. Ars Comb. 69 (2003) - Amir Daneshgar, Reza Naserasr:
On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets. Ars Comb. 69 (2003)
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-11-15 19:21 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:
