263 search results - page 8 / 53 » Path partitions of hypercubes |
120
click to vote
COCOON
2006
Springer
15 years 5 months ago
2006
Springer
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
123
click to vote
ISCAPDCS
2004
15 years 3 months ago
2004
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...
113
Voted
ORL
2007
15 years 1 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
111
click to vote
BIRTHDAY
2009
Springer
15 years 8 months ago
2009
Springer
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s...
125
click to vote
DM
2006
15 years 1 months ago
2006
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some ...