Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Some Remarks on Rainbow Connectivity   An edge (vertex) coloured graph is rainbow-connected if there is a rainbow
path between any two vertices, i.e. a path all of whose edges (internal
vertices) carry distinct colours. Rainbow edge (vertex) connectivity of a graph
$G$ is the smallest number of colours needed for a rainbow edge (vertex)
colouring of $G$. In this paper we propose a very simple approach to studying
rainbow connectivity in graphs. Using this idea, we give a unified proof of
several known results, as well as some new ones.

22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
13
The categories of this paper are: quant-ph
19
The categories of this paper are: eess
3
The categories of this paper are: physics
33
The categories of this paper are: plasm-ph
4
The categories of this paper are: cond-mat
30
The categories of this paper are: q-alg
25
The categories of this paper are: patt-sol
12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph
18
The categories of this paper are: econ