Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Mathematica Contemporanea, Volume 2
Volume 2, Number 1, 2009
- Thomas W. Tucker:
On the cover of this journal.
- Branko Grünbaum:
A catalogue of simplicial arrangements in the real projective plane. 1-25 - Bostjan Bresar, Manoj Changat, Sandi Klavzar, Joseph Mathews, Antony Mathews, Prasanth G. Narasimha-Shenoi
:
Characterizing posets for which their natural transit functions coincide. 27-33 - Dragan Stevanovic:
Large sets of long distance equienergetic graphs. 35-40 - Klavdija Kutnar, Aleksander Malnic, Dragan Marusic, Stefko Miklavic:
The strongly distance-balanced property of the generalized Petersen graphs. 41-47 - Tomaz Pisanski, Janez Zerovnik:
Edge-contributions of some topological indices and arboreality of molecular graphs. 49-58 - Edward Dobson:
On overgroups of regular abelian p-groups. 59-76 - Gábor Salamon:
Vulnerability bounds on the number of spanning tree leaves. 77-92 - Gopalapillai Indulal:
Distance spectrum of graph compositions. 93-100 - Zachary Bradshaw, Richard H. Hammack:
Minimum cycle bases of direct products of graphs with cycles. 101-119 - Miklós Bartha, Miklós Krész:
Deciding the deterministic property for soliton graphs. 121-136
Volume 2, Number 2, 2009
- Tomaz Pisanski, Dragan Marusic:
Breaking the cycle.
- Joy Morris, Cheryl E. Praeger, Pablo Spiga:
Strongly regular edge-transitive graphs. 137-155 - Bojan Mohar:
The genus crossing number. 157-162 - Dimitri Leemans, Egon Schulte:
Polytopes with groups of type PGL_2(q). 163-171 - Tomaz Pisanski:
Counting edge-transitive, one-ended, three-connected planar maps with a given growth rate. 173-180 - Valery A. Liskovets, Alexander D. Mednykh:
On the number of connected and disconnected coverings over a manifold. 181-189 - Richard H. Hammack, Wilfried Imrich:
On Cartesian skeletons of graphs. 191-205 - Yasuhiro Nakashima:
A partial generalization of the Livingstone-Wagner Theorem. 207-215 - Irene Sciriha:
Maximal core size in singular graphs. 217-229 - Philipp-Jens Ostermeier, Marc Hellmuth, Josef Leydold, Konstantin Klemm, Peter F. Stadler:
A note on quasi-robust cycle bases. 231-240 - Marko Petkovsek, Helena Zakrajsek:
Enumeration of I-graphs: Burnside does it again. 241-262
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-06-21 22:42 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:
