Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 58
Volume 58, January 2001
- David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam:
Two families of graphs that are not CCE-orientable. Ars Comb. 58 (2001) - Lauren K. Williams:
On Exact n-Step Domination. Ars Comb. 58 (2001) - David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart:
Multipartite Ramsey Numbers. Ars Comb. 58 (2001) - Toshinori Sakai:
Long Paths and Cycles Through Specified Vertices in k-Connected Graphs. Ars Comb. 58 (2001) - Guantao Chen, Ralph J. Faudree, Warren E. Shreve:
Weak Clique-Covering Cycles and Paths. Ars Comb. 58 (2001) - Gary Haggard, Thomas R. Mathies:
Using Thresholds to Compute Chromatic Polynomials. Ars Comb. 58 (2001) - John Ginsburg, V. Linek:
A space-filling complete graph. Ars Comb. 58 (2001) - Jenifer Corp, Jennifer McNulty:
On A Characterization of Balanced Matroids. Ars Comb. 58 (2001) - Jason I. Brown, Richard J. Nowakowski:
Bounding the Roots of Independence Polynomials. Ars Comb. 58 (2001) - Peter Che Bor Lam, Wai Chee Shiu, Feng Sun, Jianfang Wang, Guiying Yan:
Linear Vertex Arboricity, Independence Number and Clique Cover Number. Ars Comb. 58 (2001) - Peter Horák, Edward A. Bertram, Salem Mohammed Al-Yakoob:
Small 2-factors of Bipartite Graphs. Ars Comb. 58 (2001) - Maria Kwasnik, Maciej Zwierzchowski:
Special Kinds of Domination Parameters of Edge-Deleted Graphs. Ars Comb. 58 (2001) - Allen G. Fuller, Ronald J. Gould:
Path Spectra and Forbidden Families. Ars Comb. 58 (2001) - Riste Skrekovski:
A note on choosability with separation for planar graphs. Ars Comb. 58 (2001) - William Pensaert:
Minimum Average Broadcast Time in a Graph of Bounded Degree. Ars Comb. 58 (2001) - Klaus Dohmen:
A New Perspective on the Union-Closed Sets Conjecture. Ars Comb. 58 (2001) - Sanpei Kageyama, Tsutomu Shimata:
A combinatorial structure of affine (a1, ..., at)-resolvable (r, l)-designs. Ars Comb. 58 (2001) - Jianping Li, Ruqun Shen, Feng Tian:
Cycles Containing Given Subsets in 1-Tough Graphs. Ars Comb. 58 (2001) - Zhang Cheng-heng:
The Lucas Matrix of Order 2k Sequence {L(2k)n). Ars Comb. 58 (2001) - Ignacio M. Pelayo, Camino Balbuena, José Gómez:
On the connectivity of generalized p-cycles. Ars Comb. 58 (2001) - Heather Gavlas:
A New Distance Measure between Graphs. Ars Comb. 58 (2001) - Toru Kojima, Kiyoshi Ando:
Minimum length of cycles through specified vertices in graphs with wide-diameter at most d. Ars Comb. 58 (2001) - Himmet Can, Lee Hawkins:
A Computer Program for Obtaining Subsystems. Ars Comb. 58 (2001) - Lutz Volkmann:
Spanning multipartite tournaments of semicomplete multipartite digraphs. Ars Comb. 58 (2001) - Antoaneta Klobucar:
K-dominating sets of P[2k+2]xP[n] and P[m]xP[n]. Ars Comb. 58 (2001) - Siaw-Lynn Ng, Peter R. Wild:
On k-arcs Covering a Line in Finite Projective Planes. Ars Comb. 58 (2001) - Hong Wang:
On Quadrilaterals and Cycle Covers in a Bipartite Graph. Ars Comb. 58 (2001) - Ian M. Wanless:
McLeish's construction for Latin squares without intercalates. Ars Comb. 58 (2001)
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-07-01 21:39 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:
