default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDContributions to Discrete Mathematics, Volume 5
Volume 5, Number 1, 2010
- Francesco Maffioli, Norma Zagaglia Salvi:
A characterization of the base-matroids of a graphic matroid. - Abdo Y. Alfakih:
On the universal rigidity of generic bar frameworks. - Leah Wrenn Berman, Branko Grünbaum:
Deletion constructions of symmetric 4-configurations. Part I. - Hamza Si Kaddour, Elias Tahhan Bittar:
On the number of components of a graph. - Bernd Schulze:
Injective and non-injective realizations with symmetry. - Klas Markström, Lars-Daniel Öhman:
Unavoidable arrays. - Margarita Spirova:
On a theorem of G. D. Chakerian.
Volume 5, Number 2, 2010
- Changping Wang:
Signed b-matchings and b-edge covers of strong product graphs. - Mustapha Chellali, Frédéric Maffray, Kamel Tablennehas:
Connected domination dot-critical graphs. - Lionel Nguyen Van Thé:
Some Ramsey theorems for finite n-colorable and n-chromatic graphs. - Mohamed El Bachraoui:
On the Parity of p(n, 3) and pΨ(n, 3). - Gwenaël Joret, Marcin Kaminski, Dirk Oliver Theis:
The Cops and Robber game on graphs with forbidden (induced) subgraphs. - Anthony Bonato, Przemyslaw Gordinowicz, Pawel Pralat:
Bounds and constructions for n-e.c. tournaments. - Kazuhiro Kawamura:
Homotopy types of independence complexes of forests. - Daniel Pellicer, Asia Ivic Weiss:
Generalized CPR-graphs and applications. - Michael Ian Hartley, Alexander Hulpke:
Polytopes derived from sporadic simple groups. - Laurent Imbert, Fabrice Philippe:
Strictly chained (p, q)-ary partitions. - Terence Tao:
Freiman's theorem for solvable groups. - R. B. Bapat:
Least-squares approximation by a tree distance.
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-12-31 21:50 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:
