Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 325
Volume 325, June 2014
- Ales Drápal
, Terry S. Griggs, Andrew R. Kozlik:
Triple systems and binary operations. 1-11 - Marthe Bonamy, Nicolas Bousquet:
Brooks' theorem on powers of graphs. 12-16 - Yancai Zhao, Lianying Miao, Shiyou Pang, Wenyao Song:
Acyclic vertex coloring of graphs of maximum degree six. 17-22 - Douglas R. Stinson, Colleen Swanson, Tran van Trung:
A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs. 23-31 - Shi-Chao Chen:
On the number of overpartitions into odd parts. 32-37 - Tom Høholdt, Jørn Justesen:
On the sizes of expander graphs and minimum distances of graph codes. 38-46 - Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis:
On decomposing even regular multigraphs into small isomorphic trees. 47-51 - Kinkar Chandra Das, Seyed Ahmad Mojallal:
On Laplacian energy of graphs. 52-64 - Jung-Heum Park, Insung Ihm:
Disjoint path covers in cubes of connected graphs. 65-73 - Pawel Petecki:
On cyclic Hamiltonian decompositions of complete k-uniform hypergraphs. 74-76 - Sarah-Marie Belcastro, Ruth Haas:
Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs. 77-84 - Michael D. Plummer, Akira Saito:
A note on graphs contraction-critical with respect to independence number. 85-91
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-17 21:25 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:
