686 search results - page 47 / 138 » Packing Cycles in Graphs |
95
Voted
CORR
2008
Springer
15 years 16 days ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
105
click to vote
JCT
2011
14 years 3 months ago
2011
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
90
Voted
ARSCOM
2004
15 years 10 days ago
2004
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...
103
click to vote
CSR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
119
Voted
ISPAN
2008
IEEE
15 years 6 months ago
2008
IEEE
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...