Filters








9,714 Hits in 4.3 sec

European Journal of Combinatorics Contents, Volume 26

2005 European journal of combinatorics (Print)  
of colorings . . . . . . . . . . 779  ...  Projective-planar double coverings of graphs . . . . 325 JUVAN, M. and MOHAR, B., 2-restricted extensions of partial embeddings of graphs . . . . . . . . . . . . . . . . 339 MARUŠIČ, D., PISANSKI, T. and  ... 
doi:10.1016/s0195-6698(05)00128-9 fatcat:fb5uilehgvgzxgmj7sfw4lm5hq

European Journal of Combinatorics Index, Volume 26

2005 European journal of combinatorics (Print)  
of partial embeddings of graphs . . . . . . . . . . . . . . . . 339 KAWARABAYASHI, K.  ...  -J., Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds . . . . . 457 JOHNSON JR., P.D. and RODGER, C.A., Coloring the vertices of a graph with measurable sets  ... 
doi:10.1016/s0195-6698(05)00129-0 fatcat:vuytixhru5bupfpbxzzanswabu

European Journal of Combinatorics Index, Volume 27

2006 European journal of combinatorics (Print)  
-J. and YAO, X., Group connectivity of graphs with diameter at most 2 . . . . . . . . . . . . . . . . . 436 LAWRENCE, J., The odd-even invariant of an oriented matroid . . . 806 LECOUVEY, C., Combinatorics  ...  the tight-span of a totally split-decomposable metric . . . . . . 461 ISAAK, G., Hamiltonicity of digraphs for universal cycles of permutations 801 KAMAE, T. and HUI, R., Maximal pattern complexity of  ... 
doi:10.1016/s0195-6698(06)00172-7 fatcat:vbqngwklizcsnb7ze7f6ytsib4

European Journal of Combinatorics Contents, Volume 27

2006 European journal of combinatorics (Print)  
ideals . . . 513 BERNSTEIN, D., A combinatorial proof of a bibasic trigonometric identity 518 LECOUVEY, C., Combinatorics of crystal graphs and Kostka-Foulkes polynomials for the root systems B n , C  ...  -J., CHEPOI, V., DRESS, A. and KOOLEN, J., Combinatorics of lopsided sets . . . . . . . . . . . . . . . 669 TROFIMOV, V.I., On geometric properties of directed vertex-symmetric graphs . . . . . . . . .  ...  ., A sufficient condition for a family of graphs being determined by their generalized spectra . . . . . . . 826 HIRASAKA, M., Upper bounds given by equitable partitions of a primitive association scheme  ... 
doi:10.1016/s0195-6698(06)00171-5 fatcat:7v4bvtiq2nalrofxppnpscurbm

Introducing article numbering to European Journal of Combinatorics

Simone Munao
2019 European journal of combinatorics (Print)  
Introducing article numbering to European Journal of Combinatorics Within the publishing industry, article numbering has emerged as an easy and efficient way to cite journal articles.  ...  Based on that positive feedback, we are now pleased to introduce article numbering to European Journal of Combinatorics from August 2019. What is article numbering?  ... 
doi:10.1016/j.ejc.2019.103012 fatcat:6nendu35ovblxabqj434rltsw4

Comments on "Supersolvable frame-matroid and graphic-lift lattices" by T. Zaslavsky [European Journal of Combinatorics 22 (2001) 119]

Lori Koban
2004 European journal of combinatorics (Print)  
Unfortunately, one type of modular copoint is missing in the classification.  ...  To characterize supersolvable frame matroids, Zaslavsky, in his 2001 paper "Supersolvable framematroid and graphic-lift lattices", utilizes a classification of their modular copoints.  ...  dependence matroid of a subset of a classical root system.  ... 
doi:10.1016/s0195-6698(03)00122-7 fatcat:pzwvdjy32fbhfmdjsafylhgp3q

Cutting Planes in Combinatorics

V. Chvátal
1985 European journal of combinatorics (Print)  
Since each feasible solution of (1) is a feasible solution of (2), the optimal value of (2) provides an upper bound on the optimal value of (1).  ...  In the same spirit, we illustrate the use of cutting-plane arguments in solutions of combinatorial problems.  ...  Since each feasible solution of (1) is a feasible solution of (2), the optimal value of (2) provides an upper bound on the optimal value of (1).  ... 
doi:10.1016/s0195-6698(85)80031-7 fatcat:n7y7t7sl2nfd7aux323tcmsblq

Combinatorics of inductively factored arrangements

Michel Jambu, Luis Paris
1995 European journal of combinatorics (Print)  
An arrangement of hyperplanes in V is a finite family z~ of hyperplanes of V through the origin.  ...  Let Coul(M') be the set of coloured chambers of M', and let Coul(~") be the set of coloured chambers of ~".  ... 
doi:10.1016/0195-6698(95)90032-2 fatcat:3jhwkcewuvgzrec3wquqztgxvq

Combinatorics of generalized Tchebycheff polynomials

Dongsu Kim, Jiang Zeng
2003 European journal of combinatorics (Print)  
of the second kind (  ...  By considering a family of orthogonal polynomials generalizing the Tchebycheff polynomials of the second kind we refine the corresponding results of De Sainte-Catherine and Viennot on Tchebycheff polynomials  ...  An element of S is called a vertex of G and that of E an edge of G. A matching µ of the graph G is a subset of edges such that no two edges of µ have a common vertex.  ... 
doi:10.1016/s0195-6698(03)00046-5 fatcat:2qcn7vutxjdihn62q2xcoau5iq

The origins of combinatorics on words

Jean Berstel, Dominique Perrin
2007 European journal of combinatorics (Print)  
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration.  ...  These considerations gave rise to early results such as those of Axel Thue at the beginning of the 20th century.  ...  The anonymous referee made a great number of concrete suggestions for improvements.  ... 
doi:10.1016/j.ejc.2005.07.019 fatcat:hgw2rs5ve5g6ral7o3ftmtsney

A Theorem of Molien Type in Combinatorics

Torbjörn Tambour
1989 European journal of combinatorics (Print)  
In this note we give a simple proof of a special case of the Polya enumeration theorem , and also a new proof of Burnside's lemma.  ...  . , Sk} of S is a fixed point of g if and only if it is a union of orbits of (g) in S. Hence L E S/(g), let V(O) be the subspace with basis O.  ...  As an endomorphism of V(O), g has the suitable ordering of the basis.  ... 
doi:10.1016/s0195-6698(89)80049-6 fatcat:a3rdk26jsnddvenpb4bqr32pua

The Combinatorics of Meixner Polynomials: Linearization Coefficients

A. de Médicis
1998 European journal of combinatorics (Print)  
We describe various aspects of the Meixner polynomials. These include combinatorial descriptions of the moments, the orthogonality relation, and the linearization coefficients.  ...  Also, de Médicis, Stanton and White [4] studied the linearization coefficients problem for q-Charlier polynomials, which uses some deep results on the combinatorics of q-Stirling numbers.  ...  The combinatorics of q-Laguerre polynomials has been studied by de Médicis and Viennot [5] , Simion and Stanton [15] , and Zeng [19] , but no-one has addressed the linearization coefficients problem  ... 
doi:10.1006/eujc.1997.0174 fatcat:i2cy5df2bnejxlom57syrz64tq

The combinatorics of associated Hermite polynomials

Dan Drake
2009 European journal of combinatorics (Print)  
We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution.  ...  We find combinatorial interpretations of the moments as complete matchings, connected complete matchings, oscillating tableaux, and rooted maps and show weight-preserving bijections between these objects  ...  Acknowledgements This work is based on part of the author's doctoral thesis, completed at the University of Minnesota under the direction of Dennis Stanton.  ... 
doi:10.1016/j.ejc.2008.05.009 fatcat:mawcythf5rg7tjxsde7bept26m

Some Combinatorics of the Hypergeometric Series

Jacques Labelle, Yeong Nan Yeh
1988 European journal of combinatorics (Print)  
a sequence of isomorphisms, regroupings and degroupings of structures).  ...  The idea of the proofs is to find weighted combinatorial structures which form models for each side of the formula and to show how to go from the first to the second model by a 'weak isomorphism' (i.e.  ...  The combinatorics of the hypergeometric series 2 F" which was considered in Section 4, will be extended to ,F" 2 Fo, 3 F2 in [18] .  ... 
doi:10.1016/s0195-6698(88)80056-8 fatcat:eq4ikfom4behlii3symhsprmhy

Combinatorics of lopsided sets

Hans-Jürgen Bandelt, Victor Chepoi, Andreas Dress, Jack Koolen
2006 European journal of combinatorics (Print)  
We develop a theory of isometric subgraphs of hypercubes for which a certain inheritance of isometry plays a crucial role.  ...  One of these descriptions identifies these particular set systems alias sets of sign vectors as the lopsided sets originally introduced by Lawrence in order to investigate the subgraphs of the n-cube that  ...  Acknowledgements Most of this work was done between 1995 and 1998 while V.C. was visiting SFB343 "Diskrete Strukturen in der Mathematik", Universität Bielefeld and J.K. was visiting the Forschungsschwerpunkt  ... 
doi:10.1016/j.ejc.2005.03.001 fatcat:xxk6gw2fufgexiuyaxzg5chfz4
« Previous Showing results 1 — 15 out of 9,714 results