![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Contributions to Discrete Mathematics, Volume 9
Volume 9, Number 1, 2014
- Igors Gorbovickis:
Kneser-Poulsen conjecture for a small number of intersections. - Elissa Ross:
The rigidity of periodic frameworks as graphs on a fixed torus. - Abderrahim Boussaïri, Pierre Ille:
Determination of the prime bound of a graph. - Stefan Steinerberger:
A short note on integer complexity. - William Baird, Andrew Beveridge, Anthony Bonato, Paolo Codenotti, Aaron Maurer, John McCauley, Silviya Valeva:
On the minimum order of $k$-cop win graphs. - Lorenzo Traldi:
Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices.
Volume 9, Number 2, 2014
- Anthony Nixon, John C. Owen:
An inductive construction of (2, 1)-tight graphs. - Glenn G. Chappell, John G. Gimbel, Chris Hartman:
On cycle packings and feedback vertex sets. - Julian A. Allagan:
Chromatic polynomials of some sunflower mixed hypergraphs. - Bernd S. W. Schroeder:
The copnumber for lexicographic products and sums of graphs. - Anthony Bonato, Nancy E. Clarke, Stephen Finbow, Shannon L. Fitzpatrick, Margaret-Ellen Messinger:
A note on bounds for the cop number using tree decompositions. - Robert Thomas:
Colouring isonemal fabrics with more than two colours by thin striping. - Michael Severino:
A short construction of highly chromatic digraphs without short cycles.
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.