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
This survey is devoted to problems and results concerning covering the vertices of edge colored grap...
A vertex covering set S containing at least one vertex from each color class is called a vertex cove...
AbstractIn this paper we study when a bipartite graph is a covering of a non-bipartite graph. We giv...
AbstractIf we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with res...
A path partition or a path cover of a graph G is a collection P of paths in G such that every edge o...
summary:The construction of the extended double cover was introduced by N. Alon [1] in 1986. For a s...
AbstractTheorems of Vizing and Shannon establish upper bounds for the chromatic index of a graph. Us...
Consider a graph G with chromatic number k and a collection of complete bipartite graphs, or bicliqu...
AbstractIn this paper we give some new lower bounds for the cover-index of graphs with multiple edge...
AbstractDefine a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which ...
AbstractGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic...
AbstractLet k=3 or 4, and let n be a natural number not divisible by k−1. Consider any edge coloring...
Enumerative results are presently a major center of interest in topological graph theory, as in the ...
AbstractThe tree graph T(G) of a connected graph G has as vertices the spanning trees of G, and two ...
AbstractEnumerative results are presently a major center of interest in topological graph theory, as...
This survey is devoted to problems and results concerning covering the vertices of edge colored grap...
A vertex covering set S containing at least one vertex from each color class is called a vertex cove...
AbstractIn this paper we study when a bipartite graph is a covering of a non-bipartite graph. We giv...
AbstractIf we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with res...
A path partition or a path cover of a graph G is a collection P of paths in G such that every edge o...
summary:The construction of the extended double cover was introduced by N. Alon [1] in 1986. For a s...
AbstractTheorems of Vizing and Shannon establish upper bounds for the chromatic index of a graph. Us...
Consider a graph G with chromatic number k and a collection of complete bipartite graphs, or bicliqu...
AbstractIn this paper we give some new lower bounds for the cover-index of graphs with multiple edge...
AbstractDefine a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which ...
AbstractGraph bundles generalize the notion of covering graphs and products of graphs. The chromatic...
AbstractLet k=3 or 4, and let n be a natural number not divisible by k−1. Consider any edge coloring...
Enumerative results are presently a major center of interest in topological graph theory, as in the ...
AbstractThe tree graph T(G) of a connected graph G has as vertices the spanning trees of G, and two ...
AbstractEnumerative results are presently a major center of interest in topological graph theory, as...
This survey is devoted to problems and results concerning covering the vertices of edge colored grap...
A vertex covering set S containing at least one vertex from each color class is called a vertex cove...
AbstractIn this paper we study when a bipartite graph is a covering of a non-bipartite graph. We giv...
DOI
Add to ORKG