AbstractIf we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with respect to G and we show that it coincides with the chromatic number of a double covering of G with co-support H. We also find a few estimations for the chromatic numbers of H with respect to G
The neighborhood complex N(G) is a simplicial complex assigned to a graph G whose connectivity gives...
AbstractIn this paper we have investigated mainly the three colouring parameters of a graph G, viz.,...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
AbstractIf we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with res...
Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers...
AbstractTheorems of Vizing and Shannon establish upper bounds for the chromatic index of a graph. Us...
AbstractGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic...
A vertex covering set S containing at least one vertex from each color class is called a vertex cove...
Consider a graph G with chromatic number k and a collection of complete bipartite graphs, or bicliqu...
The aim of this paper is to study the isoperimetric numbers of double coverings of a complete graph....
AbstractThe tree graph T(G) of a connected graph G has as vertices the spanning trees of G, and two ...
AbstractIn this paper we study the b-chromatic number of a graph G. This number is defined as the ma...
We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of...
AbstractThe subchromatic number XS(G) of a graph G=(V,E) is the smallest order k of a partition {V1,...
We consider a generalisation of the classical Ramsey theory setting to a setting where each of the e...
The neighborhood complex N(G) is a simplicial complex assigned to a graph G whose connectivity gives...
AbstractIn this paper we have investigated mainly the three colouring parameters of a graph G, viz.,...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
AbstractIf we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with res...
Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers...
AbstractTheorems of Vizing and Shannon establish upper bounds for the chromatic index of a graph. Us...
AbstractGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic...
A vertex covering set S containing at least one vertex from each color class is called a vertex cove...
Consider a graph G with chromatic number k and a collection of complete bipartite graphs, or bicliqu...
The aim of this paper is to study the isoperimetric numbers of double coverings of a complete graph....
AbstractThe tree graph T(G) of a connected graph G has as vertices the spanning trees of G, and two ...
AbstractIn this paper we study the b-chromatic number of a graph G. This number is defined as the ma...
We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of...
AbstractThe subchromatic number XS(G) of a graph G=(V,E) is the smallest order k of a partition {V1,...
We consider a generalisation of the classical Ramsey theory setting to a setting where each of the e...
The neighborhood complex N(G) is a simplicial complex assigned to a graph G whose connectivity gives...
AbstractIn this paper we have investigated mainly the three colouring parameters of a graph G, viz.,...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
DOI
Add to ORKG