GC
2010
Springer
13 years 9 months ago
2010
Springer
GC
2010
Springer
13 years 11 months ago
2010
Springer
GC
2010
Springer
13 years 11 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
GC
2010
Springer
14 years 25 days ago
2010
Springer
GC
2010
Springer
14 years 25 days ago
2010
Springer
A new class of polyhedra is discovered—bipyramids of arbitrarily prescribed genus. A two-dimensional generalization of Fáry’s Theorem is established. A purely combinatorial de...
GC
2010
Springer
14 years 25 days ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
GC
2010
Springer
14 years 25 days ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
GC
2010
Springer
14 years 25 days ago
2010
Springer
GC
2010
Springer
14 years 25 days ago
2010
Springer
Abstract. In this paper we establish two symmetric identities on sums of products of Euler polynomials.
GC
2010
Springer
14 years 25 days ago
2010
Springer