Precoloring extension on unit interval graphs

In the precoloring extension problem a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [Precoloring extension. III. Classes of perfect graphs, Combin. Probab. Comput. 5 (1) (1996) 35-56], we show that the precoloring extension problem is NP-complete on unit interval graphs.     

A short note on the overpartition function

In this brief note, we give a combinatorial proof of a variation of Gauss’s q-binomial theorem, and we determine arithmetic properties of the overpartition function modulo 8.     

On the complexity of constructing Golomb Rulers

A Golomb Ruler is a ruler with integer marks where the distances between every two marks are distinct. Golomb Rulers find diverse applications in computer science and electrical engineering. According to our knowledge the computational complexity of problems related to the construction of Golomb Rulers is unknown. We provide natural definitions for problems related to the construction of such rulers. The main contribution of this work is -completeness results for two such decision problems.     

Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices

The design of fault-tolerant routings with levelled minimum optical indices plays an important role in the context of optical networks. However, not much is known about the existence of optimal routings with levelled minimum optical indices besides the results established by Dinitz, Ling and Stinson via the partitionable Steiner quadruple systems approach. In this paper, we introduce a new concept of a large set of even levelled -design of order v and index 2, denoted by -LELD, which is equivalent to an optimal, levelled (v−2)-fault-tolerant routing with levelled minimum optical indices of the complete network with v nodes. On the basis of the theory of three-wise balanced designs and partitionable candelabra systems, several infinite classes of -LELDs are constructed. As a consequence, the existence problem for optimal routings with levelled minimum optical indices is solved for nearly a third of the cases.     

Some properties for a class of interchange graphs

The Wiener number is the sum of distances between all pairs of vertices of a connected graph. In this paper, we give an explicit algebraic formula for the Wiener number of a class of interchange graphs. Moreover, distance-related properties and cliques of this class of interchange graphs are investigated.     

A note on the rank parity function

We provide some further theorems on the partitions generated by the rank parity function. New Bailey pairs are established, which are of independent interest.     

A note on ball-covering property of Banach spaces

By a ball-covering B of a Banach space X, we mean that B is a collection of open (or closed) balls off the origin whose union contains the unit sphere SX of X; and X is said to have the ball-covering property (BCP) provided it admits a ball-covering by countably many balls. In this note we give a natural example showing that the ball-covering property of a Banach space is not inherited by its subspaces; and we present a sharp quantitative version of the recent Fonf and Zanco renorming result saying that if the dual X^∗ of X is w^∗ separable, then for every ε>0 there exist a (1+ε)-equivalent norm on X, and an R>0 such that in this new norm SX admits a ball-covering by countably many balls of radius R. Namely, we show that R=R(ε) can be taken arbitrarily close to (1+ε)/ε, and that for X=?₁[0,1] the corresponding R cannot be equal to 1/ε. This gives the sharp order of magnitude for R(ε) as ε→0.     

A note on exact complex travelling wave solutions for (2+1)-dimensional B-type Kadomtsev-Petviashvili equation

The -expansion method can be used for constructing exact travelling wave solutions of real nonlinear evolution equations. In this paper, we improve the -expansion method and explore new application of this method to (2+1)-dimensional B-type Kadomtsev-Petviashvili (BKP) equation. New types of exact complex travelling wave solutions of (2+1)-dimensional BKP equation are found. Some exact solutions of (2+1)-dimensional BKP equation obtained before are special cases of our results in this paper.     

On island sequences of labelings with a condition at distance two

An L(2,1)-labeling of a graph G is a function f from the vertex set of G to the set of nonnegative integers such that |f(x)−f(y)|≥2 if d(x,y)=1, and |f(x)−f(y)|≥1 if d(x,y)=2, where d(x,y) denotes the distance between the pair of vertices x,y. The lambda number of G, denoted λ(G), is the minimum range of labels used over all L(2,1)-labelings of G. An L(2,1)-labeling of G which achieves the range λ(G) is referred to as a λ-labeling. A hole of an L(2,1)-labeling is an unused integer within the range of integers used. The hole index of G, denoted ρ(G), is the minimum number of holes taken over all its λ-labelings. An island of a given λ-labeling of G with ρ(G) holes is a maximal set of consecutive integers used by the labeling. Georges and Mauro [J.P. Georges, D.W. Mauro, On the structure of graphs with non-surjective L(2,1)-labelings, SIAM J. Discrete Math. 19 (2005) 208-223] inquired about the existence of a connected graph G with ρ(G)≥1 possessing two λ-labelings with different ordered sequences of island cardinalities. This paper provides an infinite family of such graphs together with their lambda numbers and hole indices. Key to our discussion is the determination of the path covering number of certain 2-sparse graphs, that is, graphs containing no pair of adjacent vertices of degree greater than 2.     

Minimal rankings and the arank number of a path

Given a graph G, a function f:V(G)→{1,2,…,k} is a k-ranking of G if f(u)=f(v) implies every u-v path contains a vertex w such that f(w)>f(u). A k-ranking is minimal if the reduction of any label greater than 1 violates the described ranking property. The arank number of a graph, denoted ψ_r(G), is the largest k such that G has a minimal k-ranking. We present new results involving minimal k-rankings of paths. In particular, we determine ψ_r(P_n), a problem posed by Laskar and Pillone in 2000.     

A minimax theorem for vector-valued functions in lexicographic order

In this paper, a minimax theorem and a saddle point theorem are obtained for vector-valued functions in the sense of lexicographic order, respectively. An equivalent relationship between the minimax inequality and the saddle point is established. Some examples are given to illustrate our results.     

The polynomial dichotomy for three nonempty part sandwich problems

We classify into polynomial time or -complete all three nonempty part sandwich problems. This solves the polynomial dichotomy into polynomial time and -complete for this class of graph partition problems.     

Descriptive properties of families of autohomeomorphisms of the unit interval

Let H⊂C[0,1] stand for the Polish space of all increasing autohomeomorphisms of [0,1]. We show that the family of all strictly singular autohomeomorphisms is -complete. This confirms a suggestion of Graf, Mauldin and Williams. Some related results are also included.     

A note on path kernels and partitions

The detour order of a graph G, denoted by τ(G), is the order of a longest path in G. A subset S of V(G) is called a P_n-kernel of G if τ(G[S])≤n−1 and every vertex v∈V(G)−S is adjacent to an end-vertex of a path of order n−1 in G[S]. A partition of the vertex set of G into two sets, A and B, such that τ(G[A])≤a and τ(G[B])≤b is called an (a,b)-partition of G. In this paper we show that any graph with girth g has a P_n+1-kernel for every . Furthermore, if τ(G)=a+b, 1≤a≤b, and G has girth greater than , then G has an (a,b)-partition.     

Remarks on the formula for γ-interior

The paper presents a formula for the γ-interior of a set under special conditions for , more general than those in the previous paper [Acta Math. Hungar. 80 (1998) 89-93]. There are also some applications.     

Note on the m-step competition numbers of paths and cycles

Since Cohen introduced the competition graph in 1968, the competition graph has been studied widely and many variations of it have been discussed. In 2000, Cho, Kim and Nam defined and studied the m-step competition graph and computed the 2-step competition numbers of paths and cycles. Recently, Ho gave bounds for the m-step competition numbers of paths and cycles. In this paper we continue to study the m-step competition numbers of paths and cycles, partially improve the results of Ho on the upper bounds of the m-step competition numbers of paths and cycles, and show that a conjecture posed by Ho is not true.     

Relations on generalized degree sequences

We study degree sequences for simplicial posets and polyhedral complexes, generalizing the well-studied graphical degree sequences. Here we extend the more common generalization of vertex-to-facet degree sequences by considering arbitrary face-to-flag degree sequences. In particular, these may be viewed as natural refinements of the flag f-vector of the poset. We investigate properties and relations of these generalized degree sequences, proving linear relations between flag degree sequences in terms of the composition of rank jumps of the flag. As a corollary, we recover an f-vector inequality on simplicial posets first shown by Stanley.     

Facility location problems: A parameterized view

Facility location problems have been investigated in the Operations Research literature from a variety of algorithmic perspectives, including those of approximation algorithms, heuristics, and linear programming. We introduce the study of these problems from the point of view of parameterized algorithms and complexity. Some applications of algorithms for these problems in the processing of semistructured documents and in computational biology are also described.