Sciweavers

DM
2008
114views more  DM 2008»
13 years 11 months ago
Subdivisions of graphs: A generalization of paths and cycles
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
Ch. Sobhan Babu, Ajit A. Diwan
DM
2008
93views more  DM 2008»
13 years 11 months ago
The s-Hamiltonian index
Zhang Lili, Elaine M. Eschen, Hong-Jian Lai, Yehon...
DM
2008
48views more  DM 2008»
13 years 11 months ago
A note on degree-constrained subgraphs
András Frank, Lap Chi Lau, Jácint Sz...
DM
2008
91views more  DM 2008»
13 years 11 months ago
An isoperimetric inequality in the universal cover of the punctured plane
We find the largest for which any simple closed path in the universal cover R2 \ Z2 of R2 \ Z2, equipped with the natural lifted metric from the Euclidean two dimensional plane,...
Noga Alon, Adi Pinchasi, Rom Pinchasi
DM
2008
67views more  DM 2008»
13 years 11 months ago
Size of monochromatic components in local edge colorings
András Gyárfás, Gábor ...
DM
2008
73views more  DM 2008»
13 years 11 months ago
Connectivity in frame matroids
We discuss the relationship between the vertical connectivity of a biased graph and the Tutte connectivity of the frame matroid of (also known as the bias matroid of ).
Daniel C. Slilaty, Hongxun Qin
DM
2008
93views more  DM 2008»
13 years 11 months ago
Nonbinary quantum error-correcting codes from algebraic curves
We give a new exposition and proof of a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes with ...
Jon-Lark Kim, Judy Walker