相关论文: On trees with a maximum proper partial 0-1 colorin…

The distinguishing number $D(G)$ of a graph $G$ is the smallest number of colors that is needed to color the vertices of $G$ such that the only color preserving automorphism is the identity. For infinite graphs $D(G)$ is bounded by the…

This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing. Our first result states that for any two perfect matchings…

In this work, we continue the study of vertex colorings of graphs, in which adjacent vertices are allowed to be of the same color as long as each monochromatic connected component is of relatively small cardinality. We focus on colorings…

Let $P$ be a set of $2n$ points in convex position, such that $n$ points are colored red and $n$ points are colored blue. A non-crossing alternating path on $P$ of length $\ell$ is a sequence $p_1, \dots, p_\ell$ of $\ell$ points from $P$…

We present new and improved fixed-parameter algorithms for computing maximum agreement forests (MAFs) of pairs of rooted binary phylogenetic trees. The size of such a forest for two trees corresponds to their subtree prune-and-regraft…

A subgraph of an edge-colored graph is called \emph{rainbow} if all of its edges have distinct colors. There has been much research on the topic of finding a large rainbow matching in a properly edge-colored graph, where a proper…

This article is on message-passing systems where communication is (a) synchronous and (b) based on the "broadcast/receive" pair of communication operations. "Synchronous" means that time is discrete and appears as a sequence of time slots…

We consider packing tree degree sequences in this paper. We set up a conjecture that any arbitrary number of tree degree sequences without common leaves have edge disjoint tree realizations. This conjecture is known to be true for $2$ and…

For maximal planar graphs of order $n\geq 4$, we prove that a vertex--coloring containing no rainbow faces uses at most $\lfloor\frac{2n-1}{3}\rfloor$ colors, and this is best possible. For maximal graph embedded on the projective plane, we…

An equitable tree-$k$-coloring of a graph is a vertex coloring on $k$ colors so that every color class incudes a forest and the sizes of any two color classes differ by at most one.This kind of coloring was first introduced in 2013 and can…

Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness". By restricting the edges to be…

It is well known that any set of n intervals in $\mathbb{R}^1$ admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more…

We show that if a multigraph $G$ with maximum edge-multiplicity of at most $\frac{\sqrt{n}}{\log^2 n}$, is edge-coloured by $n$ colours such that each colour class is a disjoint union of cliques with at least $2n + o(n)$ vertices, then it…

Let $C \subseteq [r]^m$ be a code such that any two words of $C$ have Hamming distance at least $t$. It is not difficult to see that determining a code $C$ with the maximum number of words is equivalent to finding the largest $n$ such that…

Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists…

We construct a refined bijection $\phi$ between alternating permutations and 0-1-2 increasing trees with degree at most 2. It satisfies that the first element of alternating permutation $\pi$ is equal to the first vertex in $\phi(\pi)$ in…

In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in…

A vertex colouring is called a \emph{parity vertex colouring} if every path in $G$ contains an odd number of occurrences of some colour. Let $\chi_{p}(G)$ be the minimal number of colours in a parity vertex colouring of $G$. We show that…

A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. It is known that the list edge chromatic number $\chi'_l(G)$ of any outer-1-planar graph $G$ with…

We study weighted edge coloring of graphs, where we are given an undirected edge-weighted general multi-graph $G := (V, E)$ with weights $w : E \rightarrow [0, 1]$. The goal is to find a proper weighted coloring of the edges with as few…