European Journal of Combinatorics, Volume 29 (original) (raw)



default search action
- combined dblp search
- author search
- venue search
- publication search
Authors:
- no matches

Venues:
- no matches

Publications:
- no matches



SPARQL queries 
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Volume 29, Number 1, January 2008

Naoyuki Horiguchi, Masaaki Kitazume, Hiroyuki Nakasora
:
The Hall-Janko graph and the Witt system W10. 1-8

Antonio Pasini:
On three families of extended tilde geometries. 9-23

YoungJu Choie
, Patrick Solé:
Broué-Enguehard maps and Atkin-Lehner involutions. 24-34

Michael S. Lang:
Pseudo primitive idempotents and almost 2-homogeneous bipartite distance-regular graphs. 35-44

Amy Glen, Jacques Justin, Giuseppe Pirillo:
Characterizations of finite and infinite episturmian words via lexicographic orderings. 45-58

Daniel Pellicer:
CPR graphs and regular polytopes. 59-71

David L. Roberts, Fred S. Roberts
:
Locating sensors in paths and cycles: The case of 2-identifying codes. 72-82

Seong-Hun Paeng, Hee Je Cho:
A note on partition sum polynomials. 83-87

Yusheng Li, Jian Shen:
Bounds for Ramsey numbers of complete graphs dropping an edge. 88-94

Iain Moffatt
:
Knot invariants and the Bollobás-Riordan polynomial of embedded graphs. 95-107

Nándor Sieben:
Polyominoes with minimum site-perimeter and full set achievement games. 108-117

Sophie Huczynska
, Nikola Ruskuc
:
Pattern classes of permutations via bijections between linearly ordered sets. 118-139

David M. Bundy:
Sharp groups, two-weight codes and maximal arcs. 140-147

Cai Heng Li
, Jiangmin Pan:
Finite 2-arc-transitive abelian Cayley graphs. 148-158

Lori Koban:
A modular triple characterization of circuit signatures. 159-170

Pierre Dehornoy:
On the 3-distortion of a path. 171-178

Eli Berger, Irith Ben-Arroyo Hartman:
Proof of Berge's strong path partition conjecture for k=2. 179-192

Aleksandar Jurisic, Jack H. Koolen
, Arjana Zitnik
:
Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3. 193-207

Sa'ar Hersonsky:
Energy and length in a topological planar quadrilateral. 208-217

Jakub Cerný:
A simple proof for open cups and caps. 218-226

Emerson L. Monte Carmelo
, Irene N. Nakaoka
:
Short coverings in tridimensional spaces arising from sum-free sets. 227-233

Alexander Engström:
Independence complexes of claw-free graphs. 234-241

Bart De Bruyn:
A coordinatization structure for generalized quadrangles with a regular spread. 242-253

Jaroslav Nesetril
, Claude Tardif:
A dualistic approach to bounding the chromatic number of a graph. 254-260

Yun Liu, Kar-Ping Shum, Yuqi Guo:
Relatively regular languages and thin codes. 261-267

Alice Devillers
:
A classification of finite partial linear spaces with a primitive rank 3 automorphism group of grid type. 268-272

Norihide Tokushige
:
Brace-Daykin type inequalities for intersecting families. 273-285

Frédéric Meunier:
Combinatorial Stokes formulae. 286-297

Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao:
Spanning cycles in regular matroids without M*(K5) minors. 298-310

Michael Chmutov, Sergei Chmutov, Yongwu Rong:
Knight move in chromatic cohomology. 311-321

Satoshi Murai:
A combinatorial proof of Gotzmann's persistence theorem for monomial ideals. 322-333

Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores
:
Posets, clique graphs and their homotopy type. 334-342

Thomas Lam:
Ribbon Schur operators. 343-359
Volume 29, Number 2, February 2008

Giampiero Chiaselotti, Gennaro Infante
, Giuseppe Marino
:
New results related to a conjecture of Manickam and Singhi. 361-368

Kaishun Wang, Fenggao Li:
Deza digraphs II. 369-378

Kaishun Wang, Zengti Li:
Lattices associated with distance-regular graphs. 379-385

Dieter Rautenbach, Christian Szegedy, Jürgen Werber:
On the cost of optimal alphabetic code trees with unequal letter costs. 386-394

François Descouens, Hideaki Morita:
Factorization formulas for MacDonald polynomials. 395-410

Ken-ichi Kawarabayashi, Bruce A. Reed:
Fractional coloring and the odd Hadwiger's conjecture. 411-417

Mitsugu Hirasaka:
Nilpotent closed subsets of association schemes. 418-422

Klavdija Kutnar
, Dragan Marusic
:
Hamiltonicity of vertex-transitive graphs of order 4p. 423-438

Koen Thas:
Elation generalized quadrangles with extra automorphisms and trivial spans. 439-442

Y. B. Choe, Katharina T. Huber, Jacobus H. Koolen
, Y. S. Kwon, Vincent Moulton
:
Counting vertices and cubes in median graphs of circular split systems. 443-456

Ronald Ortner
:
Embeddability of arrangements of pseudocircles into the sphere. 457-469

Dmitri Panov, Dimitri Zvonkine:
Enumeration of almost polynomial rational functions with given critical values. 470-479

Yasuhide Numata:
Tabloids and weighted sums of characters of certain modules of the symmetric groups. 480-492

Erkko Lehtonen
:
Labeled posets are universal. 493-506

Denis S. Krotov
:
On irreducible n-ary quasigroups with reducible retracts. 507-513

Petter Brändén:
Actions on permutations and unimodality of descent polynomials. 514-531

Pingge Chen, Yaoping Hou:
On the sandpile group of P4×Cn. 532-534

Valérie Berthé, Aldo de Luca, Christophe Reutenauer:
On an involution of Christoffel words and Sturmian morphisms. 535-553
Volume 29, Number 3, April 2008

Yan-Quan Feng
, Jin Ho Kwak, Ming Yao Xu, Jin-Xin Zhou
:
Tetravalent half-arc-transitive graphs of order p4. 555-567

Guo-Niu Han:
Euler-Mahonian triple set-valued statistics on permutations. 568-580

Wenchang Chu, Qinglun Yan:
Winquist's identity and Ramanujan's partition congruence I. 581-591

Suogang Gao, Jun Guo, Baohuan Zhang, Lihui Fu:
Subspaces in d-bounded distance-regular graphs and their applications. 592-600

Thomas Zehrt:
Schläfli numbers and reduction formula. 601-616

Stefaan De Winter
, Hendrik Van Maldeghem:
The automorphism group of a class of strongly regular graphs related to Q(6, q). 617-621

Jing Xu:
Semiregular automorphisms of arc-transitive graphs with valency pq. 622-629

Sanming Zhou
:
On a class of finite symmetric graphs. 630-640

Darren B. Parker
, Randy F. Westhoff, Marty J. Wolf:
On two-path convexity in multipartite tournaments. 641-651

Mustapha Bouchakour, T. M. Contenza, Carl W. Lee, Ali Ridha Mahjoub:
On the dominating set polytope. 652-661

Jacob Chestnut, Jenya Sapir, Ed Swartz:
Enumerative properties of triangulations of spherical bundles over S1. 662-671

Nelson Y. Li, Toufik Mansour
:
An identity involving Narayana numbers. 672-675

Hans-Jürgen Bandelt, Victor Chepoi:
The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs. 676-700

Emrah Kiliç
:
The Binet formula, sums and representations of generalized Fibonacci p-numbers. 701-711

Bernard Ries
, Dominique de Werra:
On two coloring problems in mixed graphs. 712-725

José Cáceres, Alberto Márquez
, María Luz Puertas
:
Steiner distance and convexity in graphs. 726-736

Tero Laihonen
:
On cages admitting identifying codes. 737-741

Malgorzata Bednarska, Oleg Pikhurko:
Odd and even cycles in Maker-Breaker games. 742-745

Ewan Delanoy:
Completely compressible Bruhat intervals and Kazhdan-Lusztig polynomials. 746-759

Jaroslav Nesetril
, Patrice Ossona de Mendez
:
Grad and classes with bounded expansion I. Decompositions. 760-776

Jaroslav Nesetril
, Patrice Ossona de Mendez
:
Grad and classes with bounded expansion II. Algorithmic aspects. 777-791
Volume 29, Number 4, May 2008

Jaroslav Nesetril
, Oriol Serra:
Preface. 793-795

Albert Atserias:
On digraph coloring problems and treewidth duality. 796-820

Víctor Dalmau
, Andrei A. Krokhin
:
Majority constraints have bounded pathwidth duality. 821-837

Zdenek Dvorák
, Daniel Král
, Pavel Nejedlý, Riste Skrekovski
:
Coloring squares of planar graphs with girth six. 838-849

Jirí Fiala, Daniël Paulusma
, Jan Arne Telle:
Locally constrained graph homomorphisms and equitable partitions. 850-880

Jan Foniok
, Jaroslav Nesetril
, Claude Tardif:
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures. 881-899

Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo:
A dichotomy for minimum cost graph homomorphisms. 900-911

Pavol Hell, Xuding Zhu:
On the adaptable chromatic number of graphs. 912-921

Wilfried Imrich
, Janja Jerebic
, Sandi Klavzar
:
The distinguishing number of Cartesian products of complete graphs. 922-929

Gábor Kun, Jaroslav Nesetril
:
Forbidden lifts (NP and CSP for combinatorialists). 930-945

Hanno Lefmann:
Distributions of points in the unit square and large k-gons. 946-965

Martin Loebl
, Lenka Zdeborová:
The 3D Dimer and Ising problems revisited. 966-978

Cynthia Loten, Claude Tardif:
Majority functions on structures with finite duality. 979-986

László Lovász, Alexander Schrijver:
Graph parameters and semigroup functions. 987-1002

Sònia P. Mansilla, Oriol Serra
:
On s-arc transitive hypergraphs. 1003-1011

Jaroslav Nesetril
, Patrice Ossona de Mendez
:
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. 1012-1024

Jaroslav Nesetril
, Robert Sámal
:
On tension-continuous mappings. 1025-1054

Zhishi Pan, Xuding Zhu:
Minimal circular-imperfect graphs of large clique number and large independence number. 1055-1063

André Raspaud, Weifan Wang:
On the vertex-arboricity of planar graphs. 1064-1075

Ricardo Strausz
:
Erdös-Szekeres "happy end"-type theorems for separoïds. 1076-1085
Volume 29, Number 5, July 2008

Sven Herrmann:
Genocchi numbers and f-vectors of simplicial balls. 1087-1091

Feng-Gao Li, Yang-Xian Wang:
Subconstituents of symplectic graphs. 1092-1103

Sivaramakrishnan Sivasubramanian:
On the two variable distance enumerator of the Shi hyperplane arrangement. 1104-1111

Jun Wang, Sophia J. Zhang:
An Erdös-Ko-Rado-type theorem in Coxeter groups. 1112-1115

Wilfried Imrich
, Tomaz Pisanski:
Multiple Kronecker covering graphs. 1116-1122

Daqing Yang, Xuding Zhu:
Activation strategy for asymmetric marking games. 1123-1132

René Schott, G. Stacey Staples
:
Partitions and Clifford algebras. 1133-1138

Catherine S. Greenhill, Fred B. Holt, Nicholas C. Wormald:
Expansion properties of a random regular graph after random vertex deletions. 1139-1150

Jin Ho Kwak, Ju-Mok Oh:
A classification of regular t-balanced Cayley maps on dicyclic groups. 1151-1159

José A. Soto, Jirí Fiala:
Block transitivity and degree matrices. 1160-1172

Hailong Hou
, Yanfeng Luo
, Zhimi Cheng:
The endomorphism monoid of I. 1173-1185

Kris Coolsaet, Aleksandar Jurisic, Jack H. Koolen
:
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency. 1186-1199

Toufik Mansour
, Yidong Sun:
On the number of combinations without certain separations. 1200-1206

Violeta Leoreanu Fotea, Bijan Davvaz:
n-hypergroups and binary relations. 1207-1218

Ferenc Szöllösi:
Parametrizing complex Hadamard matrices. 1219-1234

Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu:
Decomposing a planar graph with girth 9 into a forest and a matching. 1235-1241

Bart De Bruyn:
The structure of the spin-embeddings of dual polar spaces and related geometries. 1242-1256

Robert C. Powers:
Sen's theorem for hierarchies. 1257-1261

Andrei Asinowski
, Toufik Mansour
:
Dyck paths with coloured ascents. 1262-1279

Jan De Beule
, Andreas Klein, Klaus Metsch, Leo Storme
:
Partial ovoids and partial spreads in symplectic and orthogonal polar spaces. 1280-1297

Augustine O. Munagi
:
Extended set partitions with successions. 1298-1308

Elena Barbieri
, Alberto Cavicchioli
, Fulvia Spaggiari
:
Universal presentations for manifold groups. 1309-1320

Zdenek Dvorák
:
On forbidden subdivision characterizations of graph classes. 1321-1332

Gerard J. Chang
:
The upper bound on k-tuple domination numbers of graphs. 1333-1336

Yaojun Chen, T. C. Edwin Cheng
, Yunqing Zhang:
The Ramsey numbers R(Cm, K7) and R(C7, K8). 1337-1352

Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
Discriminating codes in (bipartite) planar graphs. 1353-1364

Ae Ja Yee:
Combinatorial proofs of identities in basic hypergeometric series. 1365-1375
Volume 29, Number 6, August 2008

Rongquan Feng:
Preface. 1377-1378

Eiichi Bannai, Etsuko Bannai, Hideo Bannai
:
Uniqueness of certain association schemes. 1379-1395

Gargi Bhattacharyya, John Hegeman, Joohyung Kim, Jeff Langford, Sung-Yell Song:
Some existence and construction results of polygonal designs. 1396-1407

William Y. C. Chen, Susan Y. J. Wu, Catherine H. Yan
:
Linked partitions and linked cycles. 1408-1426

Frank De Clerck, Nikias de Feyter:
On connected line sets of antiflag class [0, alpha, q] in I. 1427-1435

Yingpu Deng, Mulan Liu:
Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with odd characteristic. 1436-1448

Sen-Peng Eu
, Shu-Chung Liu, Yeong-Nan Yeh:
Catalan and Motzkin numbers modulo 4 and 8. 1449-1466

Xin Gui Fang, Lu Jun Jia, Jie Wang:
On the automorphism groups of symmetric graphs admitting an almost simple group. 1467-1472

Rongquan Feng, Lei Hu, Jin Ho Kwak:
Authentication codes and bipartite graphs. 1473-1482

Tayuan Huang, Kaishun Wang, Chih-Wen Weng:
Pooling spaces associated with finite geometry. 1483-1491

Qingde Kang, Hongtao Zhao:
Large sets of Hamilton cycle decompositions of complete bipartite graphs. 1492-1501

Joseph A. Thas, Hendrik Van Maldeghem:
A characterization of the natural embedding of the split Cayley hexagon I in I by intersection numbers. 1502-1506

Jianxing Yin, Xiuling Shan, Zihong Tian:
Constructions of partitioned difference families. 1507-1519
Volume 29, Number 7, October 2008

Satoshi Yoshiara:
A characterization of a class of dimensional dual hyperovals with doubly transitive automorphism groups and its applications. 1521-1534

Alexander K. Kelmans, Alexander Postnikov:
Generalizations of Abel's and Hurwitz's identities. 1535-1543

Hyuk Han, Seunghyun Seo:
Combinatorial proofs of inverse relations and log-concavity for Bessel numbers. 1544-1554

Mario Marietti
:
On a duality in Coxeter groups. 1555-1562

William Y. C. Chen, Laura L. M. Yang
:
On Postnikov's hook length formula for binary trees. 1563-1565

Aleksander Malnic
, Dragan Marusic
, Norbert Seifter
, Primoz Sparl, Boris Zgrablic:
Reachability relations in digraphs. 1566-1581

Victor J. W. Guo
:
A new proof of a theorem of Mansour and Sun. 1582-1584

Zhizhang Shen
, Ke Qiu:
On the Whitney numbers of the second kind for the star poset. 1585-1586

Rong Luo, Rui Xu, Jianhua Yin, Gexin Yu:
Ore-condition and Z3-connectivity. 1587-1595

Benjamin Nill:
Lattice polytopes having h*-polynomials with given degree and linear coefficient. 1596-1602

Akira Hiraki:
A characterization of the Hamming graph by strongly closed subgraphs. 1603-1616

Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen
, Vincent Moulton
:
Compatible decompositions and block realizations of finite metrics. 1617-1633

Yeh-jong Pan, Chih-Wen Weng:
3-bounded property in a triangle-free distance-regular graph. 1634-1642

Brian Beavers, James G. Oxley:
Constructive characterizations of 3-connected matroids of path width three. 1643-1661

Ales Drápal
, Petr Vojtechovský
:
Explicit constructions of loops with commuting inner mappings. 1662-1681

Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon:
Trees, functional equations, and combinatorial Hopf algebras. 1682-1695

Hiroshi Nozaki:
On the rigidity of spherical t-designs that are orbits of reflection groups E8 and H4. 1696-1703

Charalambos A. Charalambides
:
Combinatorial probability interpretation of certain modified orthogonal polynomials. 1704-1716

Min Xu, Krishnaiyan Thulasiraman, Xiao-Dong Hu:
Identifying codes of cycles with odd orders. 1717-1720

Dominique Foata, Guo-Niu Han:
Fix-Mahonian calculus, I: Two transformations. 1721-1732

Daphne Der-Fen Liu, Xuding Zhu:
Fractional chromatic number of distance graphs generated by two-interval sets. 1733-1743

Yunqing Zhang, Yaojun Chen, Kemin Zhang:
The Ramsey numbers for stars of even order versus a wheel of order nine. 1744-1754

Joe Anderson, Haidong Wu:
Minimally 3-connected binary matroids. 1755-1763

Robert G. Donnelly:
Eriksson's numbers game and finite Coxeter groups. 1764-1781

Tomoki Nakamigawa:
Equivalent subsets of a colored set. 1782-1799
Volume 29, Number 8, November 2008

Nikolai P. Dolbilin, Egon Schulte:
Special issue in honor of Ludwig Danzer's 80th birthday. 1801-1802

Gergely Ambrus
, András Bezdek:
On the number of mutually touching cylinders. Is it 8? 1803-1807

Michael Baake, Uwe Grimm
, Manuela Heuer, Peter Zeiner:
Coincidence rotations of the root lattice A4. 1808-1819

Károly Bezdek
:
From the Kneser-Poulsen conjecture to ball-polyhedra. 1820-1830

Leah Wrenn Berman
, Jürgen Bokowski
:
Linear astral (n5) configurations with dihedral symmetry. 1831-1842

Ulrich Brehm, Wolfgang Kühnel:
Equivelar maps on the torus. 1843-1861

Robert Connelly:
Rigidity of packings. 1862-1871

Jürgen Eckhoff:
Common transversals in the plane: The fractional perspective. 1872-1880

Dirk Frettlöh:
Substitution tilings with statistical circular symmetry. 1881-1893

Peter Gritzmann, Barbara Langfeld:
On the index of Siegel grids and its application to the tomography of quasicrystals. 1894-1909

Branko Grünbaum:
Musings on an example of Danzer's. 1910-1918

Jeong-Yup Lee, Robert V. Moody:
Deforming Meyer sets. 1919-1924

Peter McMullen:
Lattices compatible with regular polytopes. 1925-1932

Marjorie Senechal:
A point set puzzle revisited. 1933-1944

Geoffrey C. Shephard:
Equifacetted 4-polytopes. 1945-1951

Jörg M. Wills:
A locally regular heptagon-dodecahedron embedded in 3-space. 1952-1955

Tudor Zamfirescu:
Minkowski's theorem for arbitrary convex sets. 1956-1958

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.
Unpaywalled article links
Add open access links from
to the list of external document links (if available).
load links from unpaywall.org
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the
of the Internet Archive (if available).
load content from archive.org
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from
,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from
and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from
.
load data from openalex.org
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:







