AbstractGraph 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
summary:In this paper, we give some results concerning the colouring of the product (cartesian produ...
Recent results show that several important graph classes can be embedded as subgraphs of strong prod...
AbstractIf we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with res...
AbstractGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic...
Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
AbstractGraph bundles generalize the notion of covering graphs and graph products. In Imrich et al. ...
AbstractThe topological notion of a fibre bundle is a generalization both of a Cartesian product and...
AbstractGraph bundles generalize the notion of covering graphs and graph products. In this paper we ...
AbstractGraph bundles generalize the notion of covering graphs and graph products. In [8], authors c...
Graphs and AlgorithmsThe strong chromatic index of a graph is the minimum number of colours needed t...
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges i...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
AbstractThe chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by ...
The upper embeddability of Cartesian and strong graph bundles with non-trivial base and fibre is pro...
summary:In this paper, we give some results concerning the colouring of the product (cartesian produ...
Recent results show that several important graph classes can be embedded as subgraphs of strong prod...
AbstractIf we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with res...
AbstractGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic...
Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers...
AbstractThere are four standard products of graphs: the direct product, the Cartesian product, the s...
AbstractGraph bundles generalize the notion of covering graphs and graph products. In Imrich et al. ...
AbstractThe topological notion of a fibre bundle is a generalization both of a Cartesian product and...
AbstractGraph bundles generalize the notion of covering graphs and graph products. In this paper we ...
AbstractGraph bundles generalize the notion of covering graphs and graph products. In [8], authors c...
Graphs and AlgorithmsThe strong chromatic index of a graph is the minimum number of colours needed t...
The strong chromatic index of a graph is the minimum number of colours needed to colour the edges i...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
AbstractThe chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by ...
The upper embeddability of Cartesian and strong graph bundles with non-trivial base and fibre is pro...
summary:In this paper, we give some results concerning the colouring of the product (cartesian produ...
Recent results show that several important graph classes can be embedded as subgraphs of strong prod...
AbstractIf we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with res...
DOI
Add to ORKG