On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints Fulltext Access 5 Pages 2007
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees Fulltext Access 5 Pages 2007
The crossing number of a projective graph is quadratic in the face–width Fulltext Access 5 Pages 2007
Bipartite operator decomposition of graphs and the reconstruction conjecture Fulltext Access 5 Pages 2007
New results on lower bounds for the number of (⩽ k)-facets: (extended abstract) Fulltext Access 5 Pages 2007
Generating Functions and the Solutions of Full History Recurrence Equations Fulltext Access 5 Pages 2007
Approximation algorithms and hardness results for the clique packing problem Fulltext Access 5 Pages 2007
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems Fulltext Access 5 Pages 2007
Characterization of affine Steiner triple systems and Hall triple systems Fulltext Access 5 Pages 2007
On mixed codes with covering radius 1 and minimum distance 2: (extended abstract) Fulltext Access 5 Pages 2007
Large vertex-transitive and Cayley graphs with given degree and diameter Fulltext Access 5 Pages 2007
The 7-cycle C7C7 is light in the family of planar graphs with minimum degree 5 Fulltext Access 6 Pages 2007
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal Fulltext Access 6 Pages 2007
On facets of stable set polytopes of claw-free graphs with stability number three Fulltext Access 6 Pages 2007