Sciweavers

EJC
2010
15 years 15 days ago
Facial colorings using Hall's Theorem
Frédéric Havet, Daniel Král',...
67
Voted
EJC
2010
15 years 15 days ago
The Ramsey numbers for cycles versus wheels of even order
Lianmin Zhang, Yaojun Chen, T. C. Edwin Cheng
EJC
2010
15 years 15 days ago
New bijective links on planar maps via orientations
This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures"...
Éric Fusy
EJC
2010
15 years 15 days ago
The spread of the unicyclic graphs
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue n(G), then we present two ...
Yarong Wu, Jinlong Shu
84
Voted
EJC
2010
15 years 15 days ago
Combinatorial characterization of the Assur graphs from engineering
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...
Brigitte Servatius, Offer Shai, Walter Whiteley
EJC
2010
15 years 15 days ago
Some graphs related to the small Mathieu groups
Two different constructions are given of a rank 8 arc-transitive graph with 165 vertices and valency 8, whose automorphism group
Alice Devillers, Michael Giudici, Cai Heng Li, Che...
60
Voted
EJC
2010
15 years 15 days ago
An extension of the bivariate chromatic polynomial
Ilya Averbouch, Benny Godlin, Johann A. Makowsky
89
Voted
EJC
2010
15 years 15 days ago
A linear equation for Minkowski sums of polytopes relatively in general position
The objective of this paper is to study a special family of Minkowski sums, that is of polytopes relatively in general position. We show that the maximum number of faces in the su...
Komei Fukuda, Christophe Weibel
76
Voted
EJC
2010
15 years 15 days ago
Permutation codes
Peter J. Cameron
71
Voted
EJC
2010
15 years 15 days ago
A note on antisymmetric flows in graphs
We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z3 2
Zdenek Dvorak, Tomás Kaiser, Daniel Kr&aacu...