In this paper we determine successive extremal trees with respect to the number of all \((A,2B)\)-edge colourings
Motivated by a problem in theoretical computer science suggested by Wigderson, Alon and Ben-Eliezer ...
Let c be an edge-colouring of the complete n-graph Kn with m colours. A totally multicoloured (TMC) ...
AbstractThe polynomial we consider here is the characteristic polynomial of a certain (not adjacency...
In this paper we shall show applications of the Fibonacci numbers in edge-coloured trees. In particu...
We determine the smallest and the largest number of (A,B,2C)-edge colourings in trees. We prove that...
An edge-coloring of a graph G is an assignment of colors or labels to the edges of the graph. If {A,...
The authors investigate Ramsey-type extremal problems for finite graphs. In Section 1, anti-Ramsey n...
For a fixed graph H, what is the smallest number of colours C such that there is a proper edge-colou...
AbstractLetTbe a tree such that there is a propern-coloringcof the vertices ofTwhich, besides a tech...
AbstractLet p2(G) denote the number of paths of length 2 in the graph G, and let g(v, e) = max{p2(G)...
This dissertation contains results from various areas of Combinatorics. In Chapter 2, we consider a...
Let k ≥ 3 and r ≥ 2 be natural numbers. For a graph G, let F(G, k, r) denote the number of colouring...
This thesis investigates a variety of different problems within the field of Graph Theory. Half of t...
AbstractIn this note we summarize some of the progress made recently by the author, A.G. Chetwynd an...
AbstractIn edge colouring it is often useful to have information about the degree distribution of th...
Motivated by a problem in theoretical computer science suggested by Wigderson, Alon and Ben-Eliezer ...
Let c be an edge-colouring of the complete n-graph Kn with m colours. A totally multicoloured (TMC) ...
AbstractThe polynomial we consider here is the characteristic polynomial of a certain (not adjacency...
In this paper we shall show applications of the Fibonacci numbers in edge-coloured trees. In particu...
We determine the smallest and the largest number of (A,B,2C)-edge colourings in trees. We prove that...
An edge-coloring of a graph G is an assignment of colors or labels to the edges of the graph. If {A,...
The authors investigate Ramsey-type extremal problems for finite graphs. In Section 1, anti-Ramsey n...
For a fixed graph H, what is the smallest number of colours C such that there is a proper edge-colou...
AbstractLetTbe a tree such that there is a propern-coloringcof the vertices ofTwhich, besides a tech...
AbstractLet p2(G) denote the number of paths of length 2 in the graph G, and let g(v, e) = max{p2(G)...
This dissertation contains results from various areas of Combinatorics. In Chapter 2, we consider a...
Let k ≥ 3 and r ≥ 2 be natural numbers. For a graph G, let F(G, k, r) denote the number of colouring...
This thesis investigates a variety of different problems within the field of Graph Theory. Half of t...
AbstractIn this note we summarize some of the progress made recently by the author, A.G. Chetwynd an...
AbstractIn edge colouring it is often useful to have information about the degree distribution of th...
Motivated by a problem in theoretical computer science suggested by Wigderson, Alon and Ben-Eliezer ...
Let c be an edge-colouring of the complete n-graph Kn with m colours. A totally multicoloured (TMC) ...
AbstractThe polynomial we consider here is the characteristic polynomial of a certain (not adjacency...
DOI
Add to ORKG