Add to ORKGGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers of product bundles with respect to the Cartesian, strong and tensor product whose base and fiber are cycles are determined. 1
AbstractIn this paper we study the b-chromatic number of a graph G. This number is defined as the ma...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
summary:An interesting connection between the chromatic number of a graph $G$ and the connectivity o...
AbstractGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic...
AbstractThe topological notion of a fibre bundle is a generalization both of a Cartesian product and...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
There are four standard products of graphs: the direct product, the Cartesian product, the strong pr...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
AbstractIf we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with res...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges i...
Graphs and AlgorithmsThe strong chromatic index of a graph is the minimum number of colours needed t...
AbstractThe chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by ...
AbstractIn this paper we study the b-chromatic number of a graph G. This number is defined as the ma...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
summary:An interesting connection between the chromatic number of a graph $G$ and the connectivity o...
AbstractGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic...
AbstractThe topological notion of a fibre bundle is a generalization both of a Cartesian product and...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
There are four standard products of graphs: the direct product, the Cartesian product, the strong pr...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
AbstractIf we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with res...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
The edge chromatic number of G is the minimum number of colors required to color the edges of G in s...
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges i...
Graphs and AlgorithmsThe strong chromatic index of a graph is the minimum number of colours needed t...
AbstractThe chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by ...
AbstractIn this paper we study the b-chromatic number of a graph G. This number is defined as the ma...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
summary:An interesting connection between the chromatic number of a graph $G$ and the connectivity o...