ENDM
2007
13 years 4 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
ENDM
2007
13 years 4 months ago
2007
ENDM
2007
13 years 4 months ago
2007
We show that for every n there are two simple curves on the torus intersecting at least n times without the two curves folding or spiralling with respect to each other.
ENDM
2007
13 years 4 months ago
2007
ENDM
2007
13 years 4 months ago
2007
ENDM
2007
13 years 4 months ago
2007
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most 3
ENDM
2007
13 years 4 months ago
2007
We find exact values for the game chromatic number of the Cartesian product graphs Sm Pn, Sm Cn, P2 Wn, and P2 Km,n. This extends previous results of Bartnicki et al. on the game...
ENDM
2007
13 years 4 months ago
2007
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
ENDM
2007
13 years 4 months ago
2007
d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
ENDM
2007
13 years 4 months ago
2007