default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 36
Volume 36, February 2014
- Carmen Hernando
, M. Mora, Ignacio M. Pelayo:
Nordhaus-Gaddum bounds for locating domination. 1-6 - Rong Luo, Zhengke Miao, Rui Xu, Cun-Quan Zhang:
Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts. 7-16 - Giovanni Gaiffi, Matteo Serventi:
Families of building sets and regular wonderful models. 17-38 - Jiangmin Pan:
Locally primitive Cayley graphs of dihedral groups. 39-52 - Stephen G. Hartke, Derrick Stolee:
A linear programming approach to the Manickam-Miklós-Singhi conjecture. 53-70 - Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Wiener index in weighted graphs via unification of Θ∗Θ∗-classes. 71-76 - Shi-Cai Gong, Guang-Hui Xu, Wen-Bing Zhong:
4-regular oriented graphs with optimum skew energies. 77-85 - Tamar Friedmann, Richard P. Stanley:
Counting conjugacy classes of elements of finite order in Lie groups. 86-96 - Sen-Peng Eu, Tung-Shan Fu, Yeh-Jong Pan:
A refined sign-balance of simsun permutations. 97-109 - Jakub Kozik, Piotr Micek, Xuding Zhu:
Towards an on-line version of Ohba's conjecture. 110-121 - William Y. C. Chen, Janet F. F. Peng:
Disposition polynomials and plane trees. 122-129 - Moshe Schwartz:
On the non-existence of lattice tilings by quasi-crosses. 130-142 - Hiroaki Taniguchi, Satoshi Yoshiara:
A unified description of four simply connected dimensional dual hyperovals. 143-150 - Louis DeBiasio, Tao Jiang:
On the co-degree threshold for the Fano plane. 151-158 - Douglas F. Rall, Kirsti Wash:
Identifying codes of the direct product of two cliques. 159-171 - Mark H. Siggers:
Non-bipartite pairs of 33-connected graphs are highly Ramsey-infinite. 172-189 - Yarong Wu, Guanglong Yu, Jinlong Shu:
Graphs with small second largest Laplacian eigenvalue. 190-197 - Sizhong Zhou, Qiuju Bian:
Subdigraphs with orthogonal factorizations of digraphs (II). 198-205 - Beifang Chen:
Dual complementary polynomials of graphs and combinatorial-geometric interpretation on the values of Tutte polynomial at positive integers. 206-230 - Michael Dorfling, Michael A. Henning:
Linear hypergraphs with large transversal number and maximum degree two. 231-236 - Lily Chen, Xueliang Li, Mengmeng Liu:
The (revised) Szeged index and the Wiener index of a nonbipartite graph. 237-246 - Afshin Goodarzi:
Convex hull of face vectors of colored complexes. 247-250 - James G. Oxley, Jesse Taylor:
On two classes of nearly binary matroids. 251-260 - Henning Bruhn, Maya Stein:
Minimal bricks have many vertices of small degree. 261-269 - Primoz Potocnik:
Tetravalent arc-transitive locally-Klein graphs with long consistent cycles. 270-281 - Agelos Georgakopoulos:
Characterising planar Cayley graphs and Cayley complexes in terms of group presentations. 282-293 - Bhaskar Bagchi, Basudeb Datta:
On stellated spheres and a tightness criterion for combinatorial manifolds. 294-313 - Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Short proofs of coloring theorems on planar graphs. 314-321 - Hans Adler, Isolde Adler:
Interpreting nowhere dense graph classes as a classical notion of model theory. 322-330 - Sejeong Bang, Jacobus H. Koolen:
On geometric distance-regular graphs with diameter three. 331-341 - Jaroslav Nesetril, Robert Sámal:
Flow-continuous mappings - The influence of the group. 342-347 - Rémi Cocou Avohou, Joseph Ben Geloun, Etera R. Livine:
On terminal forms for topological polynomials for ribbon graphs: The NN-petal flower. 348-366 - Erfang Shan, Zuosong Liang, Liying Kang:
Clique-transversal sets and clique-coloring in planar graphs. 367-376 - Askar Dzhumadil'daev, Damir Yeliussizov:
Stirling permutations on multisets. 377-392 - Li Wang, Shaofei Du:
Semisymmetric graphs of order 2p3. 393-405 - Zdenek Dvorák, Louis Esperet:
Distance-two coloring of sparse graphs. 406-415 - William Y. C. Chen, Alvin Y. L. Dai, Robin D. P. Zhou:
Ordered partitions avoiding a permutation pattern of length 3. 416-424 - Konrad Engel, Tadeusz Radzik, Jan-Christoph Schlage-Puchta:
Optimal integer partitions. 425-436 - Shao-Fei Du, Jun-Yang Zhang:
A classification of orientably-regular embeddings of complete multipartite graphs. 437-452 - Binlong Li, Bo Ning, Chuandong Xu, Shenggui Zhang:
Rainbow triangles in edge-colored graphs. 453-459 - Marién Abreu, Domenico Labbate, Romeo Rizzi, John Sheehan:
Odd 2-factored snarks. 460-472 - Georgia Benkart, Tom Halverson:
Motzkin algebras. 473-502 - Peter Heinig:
On prisms, Möbius ladders and the cycle space of dense graphs. 503-530 - Kan Hu, Roman Nedela, Na-Er Wang:
Branched cyclic regular coverings over platonic maps. 531-549 - Carolyn Chun, Dillon Mayhew, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids II. 550-563 - Jean-Éric Pin, Pedro V. Silva:
A noncommutative extension of Mahler's theorem on interpolation series. 564-578 - Simon Hampe:
a-tint: A polymake extension for algorithmic tropical intersection theory. 579-607 - Uwe Schwerdtfeger:
Linear functional equations with a catalytic variable and area limit laws for lattice paths and polygons. 608-640 - Mikko Pelto:
Optimal identifying codes in the infinite 3-dimensional king grid. 641-659 - Yichao Chen, Jonathan L. Gross, Xiaodong Hu:
Enumeration of digraph embeddings. 660-678 - Jin-Xin Zhou, Yan-Quan Feng:
Cubic bi-Cayley graphs over abelian groups. 679-693 - Pavol Hell, Mark H. Siggers:
Semilattice polymorphisms and chordal graphs. 694-706 - Jiuqiang Liu, Wenbo Yang:
Set systems with restricted k-wise L-intersections modulo a prime number. 707-719
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 2025-12-05 22:23 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:
