10 research outputs found
Erd\"os-Gallai-type results for conflict-free connection of graphs
A path in an edge-colored graph is called \emph{a conflict-free path} if
there exists a color used on only one of its edges. An edge-colored graph is
called \emph{conflict-free connected} if there is a conflict-free path between
each pair of distinct vertices. The \emph{conflict-free connection number} of a
connected graph , denoted by , is defined as the smallest
number of colors that are required to make conflict-free connected. In this
paper, we obtain Erd\"{o}s-Gallai-type results for the conflict-free connection
numbers of graphs.Comment: 6 page
Conflict-free connection number of random graphs
An edge-colored graph is conflict-free connected if any two of its
vertices are connected by a path which contains a color used on exactly one of
its edges. The conflict-free connection number of a connected graph ,
denoted by , is the smallest number of colors needed in order to make
conflict-free connected. In this paper, we show that almost all graphs have
the conflict-free connection number 2. More precisely, let denote the
Erd\H{o}s-R\'{e}nyi random graph model, in which each of the
pairs of vertices appears as an edge with probability independent from
other pairs. We prove that for sufficiently large , if
, where . This
means that as soon as becomes connected with high probability,
.Comment: 13 page
Conflict-free connections: algorithm and complexity
A path in an(a) edge(vertex)-colored graph is called \emph{a conflict-free
path} if there exists a color used on only one of its edges(vertices). An(A)
edge(vertex)-colored graph is called \emph{conflict-free (vertex-)connected} if
there is a conflict-free path between each pair of distinct vertices. We call
the graph \emph{strongly conflict-free connected }if there exists a
conflict-free path of length for every two vertices .
And the \emph{strong conflict-free connection number} of a connected graph ,
denoted by , is defined as the smallest number of colors that are
required to make strongly conflict-free connected. In this paper, we first
investigate the question: Given a connected graph and a coloring $c: E(or\
V)\rightarrow \{1,2,\cdots,k\} \ (k\geq 1)Gc(k\geq 2)G(u,v)\in P \ (P\subset V\times V)scfc(G)\leq k(k\geq 2)Gk=2$, which was
not done in the old versio
Conflict-free (vertex)-connection numbers of graphs with small diameters
A path in an(a) edge(vertex)-colored graph is called a conflict-free path if
there exists a color used on only one of its edges(vertices). An(A)
edge(vertex)-colored graph is called conflict-free (vertex-)connected if for
each pair of distinct vertices, there is a conflict-free path connecting them.
For a connected graph , the conflict-free (vertex-)connection number of ,
denoted by , is defined as the smallest number of
colors that are required to make conflict-free (vertex-)connected. In this
paper, we first give the exact value for any tree with diameters
and . Based on this result, the conflict-free connection number is
determined for any graph with except for those graphs
with diameter and . In this case, we give some graphs with
conflict-free connection number and , respectively. For the
conflict-free vertex-connection number, the exact value is determined
for any graph with .Comment: 12 page
Conflict-free connection number and independence number of a graph
An edge-colored graph is conflict-free connected if any two of its
vertices are connected by a path, which contains a color used on exactly one of
its edges. The conflict-free connection number of a connected graph ,
denoted by , is defined as the minimum number of colors that are
required in order to make conflict-free connected. In this paper, we
investigate the relation between the conflict-free connection number and the
independence number of a graph. We firstly show that for
any connected graph , and an example is given showing that the bound is
sharp. With this result, we prove that if is a tree with , then
Graph colorings under global structural conditions
More than ten years ago in 2008, a new kind of graph coloring appeared in
graph theory, which is the {\it rainbow connection coloring} of graphs, and
then followed by some other new concepts of graph colorings, such as {\it
proper connection coloring, monochromatic connection coloring, and
conflict-free connection coloring} of graphs. In about ten years of our
consistent study, we found that these new concepts of graph colorings are
actually quite different from the classic graph colorings. These {\it colored
connection colorings} of graphs are brand-new colorings and they need to take
care of global structural properties (for example, connectivity) of a graph
under the colorings; while the traditional colorings of graphs are colorings
under which only local structural properties (adjacent vertices or edges) of a
graph are taken care of. Both classic colorings and the new colored connection
colorings can produce the so-called chromatic numbers. We call the colored
connection numbers the {\it global chromatic numbers}, and the classic or
traditional chromatic numbers the {\it local chromatic numbers}. This paper
intends to clarify the difference between the colored connection colorings and
the traditional colorings, and finally to propose the new concepts of global
colorings under which global structural properties of the colored graph are
kept, and the global chromatic numbers.Comment: 14 page
Monochromatic disconnection of graphs
For an edge-colored graph , we call an edge-cut of monochromatic
if the edges of are colored with a same color. The graph is called
monochromatically disconnected if any two distinct vertices of are
separated by a monochromatic edge-cut. For a connected graph , the
monochromatic disconnection number, denoted by , of is the maximum
number of colors that are needed in order to make monochromatically
disconnected. We will show that almost all graphs have monochromatic
disconnection numbers equal to 1. We also obtain the Nordhaus-Gaddum-type
results for .Comment: 16 page
Strong conflict-free connection of graphs
A path in an edge-colored graph is called \emph{a conflict-free path} if
there exists a color used on only one of the edges of . An edge-colored
graph is called \emph{conflict-free connected} if for each pair of distinct
vertices of there is a conflict-free path in connecting them. The graph
is called \emph{strongly conflict-free connected }if for every pair of
vertices and of there exists a conflict-free path of length
in connecting them. For a connected graph , the \emph{strong
conflict-free connection number} of , denoted by , is
defined as the smallest number of colors that are required in order to make
strongly conflict-free connected. In this paper, we first show that if is
a connected graph with edges and edge-disjoint triangles,
then , and the equality holds if and only if
. Then we characterize the graphs with for
. In the end, we present a complete characterization
for the cubic graphs with .Comment: 23 pages, 10 figure
Improved lower bounds on parity vertex colourings of binary trees
A vertex colouring is called a \emph{parity vertex colouring} if every path
in contains an odd number of occurrences of some colour. Let
be the minimal number of colours in a parity vertex colouring of . We show
that where
is a subdivision of the complete binary tree . This improves the
previously known bound and enhances the techniques
used for proving lower bounds. We use this result to show that where is any binary tree with vertices. These lower
bounds are also lower bounds for the conflict-free colouring. We also prove
that is not monotone with respect to minors and determine its
value for cycles. Furthermore, we study complexity of computing the parity
vertex chromatic number . We show that checking whether a vertex
colouring is a parity vertex colouring is coNP-complete. Then we use
Courcelle's theorem to prove that the problem of checking whether is fixed-parameter tractable with respect and the treewidth of
Hardness results for three kinds of colored connections of graphs
The concept of rainbow connection number of a graph was introduced by
Chartrand et al. in 2008. Inspired by this concept, other concepts on colored
version of connectivity in graphs were introduced, such as the monochromatic
connection number by Caro and Yuster in 2011, the proper connection number by
Borozan et al. in 2012, and the conflict-free connection number by Czap et al.
in 2018, as well as some other variants of connection numbers later on.
Chakraborty et al. proved that to compute the rainbow connection number of a
graph is NP-hard. For a long time, it has been tried to fix the computational
complexity for the monochromatic connection number, the proper connection
number and the conflict-free connection number of a graph. However, it has not
been solved yet. Only the complexity results for the strong version, i.e., the
strong proper connection number and the strong conflict-free connection number,
of these connection numbers were determined to be NP-hard. In this paper, we
prove that to compute each of the monochromatic connection number, the proper
connection number and the conflict free connection number for a graph is
NP-hard. This solves a long standing problem in this field, asked in many talks
of workshops and papers.Comment: 23 pages, 7 figure